Portioning using ordinal preferences: Fairness and efficiency
Authors:
- Stéphane AiriauSAStéphane Airiau
- Haris AzizHAHaris Aziz
- Ioannis CaragiannisICIoannis Caragiannis
- Justin KrugerJKJustin Kruger
- Jérôme LangJLJérôme Lang
- Dominik PetersDPDominik Peters
- 25 October 2022
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 314
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Agence Nationale de la Recherche (ANR-19-P3IA-0001)
This publication has 28 references indexed in Scilit:
- The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining gameJournal of the ACM, 2012
- Lexicographically Minimum and Maximum Load Linear Programming ProblemsOperations Research, 2007
- Efficient Fair DivisionRationality and Society, 2005
- Collective choice under dichotomous preferencesJournal of Economic Theory, 2005
- A New Solution to the Random Assignment ProblemJournal of Economic Theory, 2001
- Strategic behaviour and a notion of ex ante efficiency in a voting modelSocial Choice and Welfare, 1986
- An algorithm for maximizing expected log investment returnIEEE Transactions on Information Theory, 1984
- Manipulation of Schemes that Mix Voting with ChanceEconometrica, 1977
- Lindahl's Solution and the Core of an Economy with Public GoodsEconometrica, 1970
- Equilibrium points in n -person gamesProceedings of the National Academy of Sciences, 1950