Repeatedly matching items to agents fairly and efficiently
Authors:
- Ioannis CaragiannisICIoannis Caragiannis
- Shivika NarangSNShivika Narang
- 12 October 2023
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 981
Abstract
No abstract availableKeywords
Funding Information
- Tata Consultancy Services
- Independent Research Fund Denmark
- Danmarks Frie Forskningsfond (2032-00185B)
This publication has 7 references indexed in Scilit:
- Fair allocation of indivisible goods and choresAutonomous Agents and Multi-Agent Systems, 2021
- Almost Envy-Freeness with General ValuationsSIAM Journal on Discrete Mathematics, 2020
- The Unreasonable Fairness of Maximum Nash WelfareACM Transactions on Economics and Computation, 2019
- Room Allocation With Capacity Diversity and Budget ConstraintsIEEE Access, 2019
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- Edge-Coloring Bipartite Multigraphs in O ( E log D ) TimeCombinatorica, 2001
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989