Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods

This publication has 33 references indexed in Scilit:

• Fair division of indivisible goods: Recent progress and open questions
  Artificial Intelligence, 2023
• Almost envy-free allocations with connected bundles
  Games and Economic Behavior, 2022
• Fair allocation of indivisible goods and chores
  Autonomous Agents and Multi-Agent Systems, 2021
• On the computability of equitable divisions
  Discrete Optimization, 2012
• The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
  Journal of Political Economy, 2011
• An Envy-Free Cake Division Protocol
  The American Mathematical Monthly, 1995
• A note on cake cutting
  Discrete Applied Mathematics, 1984
• How to Cut a Cake Fairly
  The American Mathematical Monthly, 1980
• Varian
  Vacuum, 1973
• How to Cut a Cake Fairly
  The American Mathematical Monthly, 1961