Subgame perfection and the rule of k-names

dc.contributor.authorGarcía Jurado, Ignacio
dc.contributor.authorMéndez Naya, Luciano
dc.date.accessioned2025-01-14T11:36:44Z
dc.date.available2025-01-14T11:36:44Z
dc.date.issued2019-01-01
dc.descriptionThis version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/s10726-019-09625-6
dc.description.abstractIn this paper we revisit the rule of k names from a game theoretic perspective. This rule can be described as follows. Given a set of candidates for a position, a committee (formed by the proposers) selects k elements of that set using a screening rule; then a single individual from outside the committee (the chooser) chooses for the position one of the k selected candidates. In this context we first give conditions for the existence of a subgame perfect equilibrium. Then we provide conditions for the existence of subgame perfect q-strong equilibria when the screening rule is -majoritarian. Finally, we show that when the chooser can strategically appoint a delegate to choose on behalf of him, the conditions for the existence of subgame perfect q-strong equilibria are weaker.
dc.description.sponsorshipAuthors acknowledge the financial support of Ministerio de Economía y Competitividad, Gobierno de España, through project MTM2014-53395-C3-1-P.
dc.identifier.citationGarcía-Jurado, I., Méndez-Naya, L. Subgame Perfection and the Rule of k Names. Group Decis Negot 28, 805–825 (2019). https://doi.org/10.1007/s10726-019-09625-6
dc.identifier.doi10.1007/s10726-019-09625-6
dc.identifier.urihttps://hdl.handle.net/10347/38561
dc.journal.titleGroup Decision and Negotiation
dc.language.isoeng
dc.page.final825
dc.page.initial805
dc.publisherSpringer
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO//MTM2014-53395-C3-1-P/ES/OPTIMIZACION Y REPARTO EN PROBLEMAS DE DECISION MULTI-AGENTE CON APLICACIONES EN PROBLEMAS DE RUTAS/
dc.relation.publisherversionhttps://doi.org/10.1007/s10726-019-09625-6
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalen
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectRule of k names
dc.subjectScreening rule
dc.subjectSubgame perfect equilibrium
dc.subjectStrong equilibrium
dc.subjectDelegation
dc.titleSubgame perfection and the rule of k-names
dc.typejournal article
dc.type.hasVersionAM
dc.volume.number28
dspace.entity.typePublication
relation.isAuthorOfPublication3565451a-9452-4dfd-957a-7aecb2c746cf
relation.isAuthorOfPublication.latestForDiscovery3565451a-9452-4dfd-957a-7aecb2c746cf

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
knames_2017_11_20.pdf
Size:
205.15 KB
Format:
Adobe Portable Document Format