SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Fair Allocation of Indivisible Goods to Asymmetric Agents
10 references·0 citing·36 second hop
Fair Allocation of Indivisible Goods to Asymmetric Agents (2019)Fair Allocation of Indivisible Goods to A…Approximation Algorithms for Computing Maximin Share Allocations (2017)Approximation Algorithms for …When Can the Maximin Share Guarantee Be Guaranteed? (2016)When Can the Maximin Share Gu…The Unreasonable Fairness of Maximum Nash Welfare (2016)The Unreasonable Fairness of …No Agent Left Behind: Dynamic Fair Division of Multiple Resources (2014)No Agent Left Behind: Dynamic…The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)The Combinatorial Assignment …Optimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingAllocating indivisible goods (2005)Allocating indivisible goodsCake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…Fair division: From cake-cutting to dispute resolution (1996)Fair division: From cake-cutt…Fair division from cake-cutting to dispute resolution (1996)Fair division from cake-cutti…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Algorithms for Max-Min Share Fair Allocation of Indivisible Chores (2017)An Improved Approximation Algorithm for Maximin Shares (2020)Approximation Algorithms for Maximin Fair Division (2020)The problem of fair division (1948)The Art and Science of Negotiation (1983)The Art and Science of Negotiation. (1984)Applications Of Negotiation Theory To Water Issues (2005)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)Fair Division (1996)Approximating the Nash Social Welfare with Indivisible Items (2018)Fair Allocation of Indivisible Goods (2018)A Little Charity Guarantees Almost Envy-Freeness (2019)On approximately fair allocations of indivisible goods (2004)The Efficiency of Fair Division (2011)Approximate Mechanism Design without Money (2013)Fair enough (2014)College Admissions and the Stability of Marriage (1962)Philosophy and Public Affairs (2000)Sovereign Virtue: The Theory and Practice of Equality (2001)Designing Random Allocation Mechanisms: Theory and Applications (2013)The Unreasonable Fairness of Maximum Nash Welfare (2019)The Bargaining Problem (1950)Resource allocation and the public sector (1967)Equity, envy, and efficiency (1974)Fair Public Decision Making (2017)Almost Envy-Freeness with General Valuations (2018)Finding Fair and Efficient Allocations (2018)Fair Division and Collective Welfare (2003)Fair assignment of indivisible objects under ordinal preferences (2015)Cake Cutting Algorithms (2016)Fair Enough (2018)Rental Harmony: Sperner's Lemma in Fair Division (1999)Mechanism design for fair division (2013)The Computational Rise and Fall of Fairness (2014)
this work references cited by second hop

References

  • 2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
  • 2016The Unreasonable Fairness of Maximum Nash Welfare346 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1996Fair division: From cake-cutting to dispute resolution249 cited
  • 2005Allocating indivisible goods176 cited
  • 2014No Agent Left Behind: Dynamic Fair Division of Multiple Resources132 cited
  • 2017Approximation Algorithms for Computing Maximin Share Allocations125 cited
  • 2011Optimal Envy-Free Cake Cutting91 cited
  • 2016When Can the Maximin Share Guarantee Be Guaranteed?87 cited
  • 1996Fair division from cake-cutting to dispute resolution70 cited

Cited by

No citing works inside the corpus for this window.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work