EconPapers    
Economics at your fingertips  
 

King-chicken choice correspondences

Matheus Costa and Gil Riella

Mathematical Social Sciences, 2022, vol. 120, issue C, 113-118

Abstract: Given a complete, though not necessarily transitive, preference relation, we propose a family of choice representations inspired by the king-chicken procedure, according to which an alternative x is chosen among a set of alternatives A if, for every other alternative y in A, either x is preferred to y or there is another alternative z in A such that x is preferred to z, and z is preferred to y. We generalize this process by allowing the path from x to y to include more than one alternative z and fully characterize the choice correspondences that can be achieved through it. Two of the most relevant tournament solutions, the uncovered set and the top-cycle, are special cases of this generalized king-chicken choice procedure, so this work improves previous results that have appeared in the choice theory literature by delivering axiomatizations for those models in generic (not necessarily finite) choice spaces.

Keywords: Nontransitive rationalization; Tournament solutions; Uncovered set; Top-cycle (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489622000774
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:120:y:2022:i:c:p:113-118

DOI: 10.1016/j.mathsocsci.2022.10.001

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-23
Handle: RePEc:eee:matsoc:v:120:y:2022:i:c:p:113-118