Abstract
A coalitional ranking describes a situation where a finite set of agents can form coalitions that are ranked according to a weak order. A social ranking solution on a domain of coalitional rankings assigns a social ranking, that is a weak order over the agent set, to each coalitional ranking of this domain. We introduce two lexicographic solutions for a variable population domain of coalitional rankings. These solutions are computed from the individual performance of the agents, then, when this performance criterion does not allow to decide between two agents, a collective performance criterion is applied to the coalitions of higher size. We provide parallel axiomatic characterizations of these two solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
