SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
16 references·0 citing·27 second hop
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores (2021)An Algorithmic Framework for Approximatin…Finding Fair and Efficient Allocations (2018)Finding Fair and Efficient Al…Fair Enough (2018)Fair EnoughFair Allocation of Indivisible Goods (2018)Fair Allocation of Indivisibl…Approximation Algorithms for Maximin Fair Division (2017)Approximation Algorithms for …Approximation Algorithms for Computing Maximin Share Allocations (2017)Approximation Algorithms for …The Unreasonable Fairness of Maximum Nash Welfare (2016)The Unreasonable Fairness of …A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)A Discrete and Bounded Envy-F…Characterizing conflicts in fair division of indivisible goods using a scale of criteria (2015)Characterizing conflicts in f…Characterizing conflicts in fair division of indivisible goods using a scale of criteria (2014)Characterizing conflicts in f…The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)The Combinatorial Assignment …On approximately fair allocations of indivisible goods (2004)On approximately fair allocat…Fair Division and Collective Welfare (2003)Fair Division and Collective …Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…Cake-Cutting Algorithms (1998)Cake-Cutting AlgorithmsResource allocation and the public sector (1967)Resource allocation and the p…The problem of fair division (1948)The problem of fair divisionEquity, envy, and efficiency (1974)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)A Short Introduction to Computational Social Choice (2007)Almost Envy-Freeness with General Valuations (2018)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)Fair Division (1996)Fair Division in the Internet Age (2019)Fair division of indivisible goods: Recent progress and open questions (2023)The Bargaining Problem (1950)Fair Public Decision Making (2017)Towards a Genuine Economic and Monetary Union (2016)Rental Harmony: Sperner's Lemma in Fair Division (1999)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)A Little Charity Guarantees Almost Envy-Freeness (2019)2. Public Goods: A Survey of Experimental Research (1995)Equality of Opportunity (1998)The Theory of Incentives: The Principal-Agent Model (2001)Some Experimental Games (1958)An experimental analysis of ultimatum bargaining (1982)Allocating indivisible goods (2005)Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity (2008)Cake cutting (2013)
this work references cited by second hop

References

  • 1967Resource allocation and the public sector1,086 cited
  • 2003Fair Division and Collective Welfare815 cited
  • 2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
  • 2004On approximately fair allocations of indivisible goods537 cited
  • 1948The problem of fair division432 cited
  • 2016The Unreasonable Fairness of Maximum Nash Welfare346 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1998Cake-Cutting Algorithms226 cited
  • 2018Finding Fair and Efficient Allocations174 cited
  • 2016A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents138 cited
  • 2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
  • 2017Approximation Algorithms for Computing Maximin Share Allocations125 cited
  • 2018Fair Enough125 cited
  • 2014Characterizing conflicts in fair division of indivisible goods using a scale of criteria113 cited
  • 2018Fair Allocation of Indivisible Goods106 cited
  • 2017Approximation Algorithms for Maximin Fair Division

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

104 cited

Cited by

No citing works inside the corpus for this window.