Lexicographic solutions for coalitional rankings
From MaRDI portal
Publication:2068883
DOI10.1007/s00355-021-01340-zzbMath1481.91073OpenAlexW3172525227MaRDI QIDQ2068883
Publication date: 20 January 2022
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-021-01340-z
Related Items (3)
Building rankings encompassing multiple criteria to support qualitative decision-making ⋮ Selecting the most relevant elements from a ranking over sets ⋮ Lexicographic solutions for coalitional rankings based on individual and collective performances
Cites Work
- Unnamed Item
- Can strategizing in round-robin subtournaments be avoided?
- Strategic manipulation in tournament games
- Rankings and values for team games
- The position value in communication structures.
- A note on the extension of an order on a set to the power set
- The theory of convex geometries
- Games with permission structures: The conjunctive approach
- An axiomatization of the disjunctive permission value for games with a permission structure
- The position value for union stable systems
- Network structures with hierarchy and communication
- Some axiomatic and algorithmic perspectives on the social ranking problem
- Harsanyi power solutions for games on union stable systems
- Ranking objects from a preference relation over their subsets
- An impossibility theorem for paired comparisons
- Some Impossibilities of Ranking in Generalized Tournaments
This page was built for publication: Lexicographic solutions for coalitional rankings
