SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
When Can the Maximin Share Guarantee Be Guaranteed?
14 references·5 citing·33 second hop
When Can the Maximin Share Guarantee Be Guaranteed? (2016)When Can the Maximin Share Guarantee Be G…Approximation Algorithms for Computing Maximin Share Allocations (2017)Approximation Algorithms for …Spliddit (2015)SplidditFair assignment of indivisible objects under ordinal preferences (2015)Fair assignment of indivisibl…Characterizing conflicts in fair division of indivisible goods using a scale of criteria (2015)Characterizing conflicts in f…Fair enough (2014)Fair enoughCharacterizing conflicts in fair division of indivisible goods using a scale of criteria (2014)Characterizing conflicts in f…Cake cutting (2013)Cake cuttingThe Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)The Combinatorial Assignment …Optimal Envy-Free Cake Cutting (2011)Optimal Envy-Free Cake CuttingEfficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity (2008)Efficiency and Envy-freeness …An approximation algorithm for max-min fair allocation of indivisible goods (2007)An approximation algorithm fo…Allocating indivisible goods (2005)Allocating indivisible goodsFair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…Fair division: From cake-cutting to dispute resolution (1996)Fair division: From cake-cutt…Approximation Algorithms for Maximin Fair Division (2020)Approximation Algorithms for …An Improved Approximation Algorithm for Maximin Shares (2020)An Improved Approximation Alg…Fair Allocation of Indivisible Goods to Asymmetric Agents (2019)Fair Allocation of Indivisibl…Fair Division Under Cardinality Constraints (2018)Fair Division Under Cardinali…Algorithms for Max-Min Share Fair Allocation of Indivisible Chores (2017)Algorithms for Max-Min Share …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)Resource allocation and the public sector (1967)Fair Division and Collective Welfare (2003)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)Stochastic Games (1953)Approximation Algorithms for Maximin Fair Division (2017)Fair Enough (2018)On approximately fair allocations of indivisible goods (2004)The Efficiency of Fair Division (2011)Approximate Mechanism Design without Money (2013)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)Computationally Manageable Combinational Auctions (1998)Computational Social Choice (2012)Combinatorial Auctions (2014)Fair Public Decision Making (2017)A theory of justice original editionAxioms of Cooperative Decision Making (1988)Collective Choice and Social Welfare (2017)The Unreasonable Fairness of Maximum Nash Welfare (2016)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)
this work references cited by second hop

References

  • 2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1996Fair division: From cake-cutting to dispute resolution249 cited
  • 2005Allocating indivisible goods176 cited
  • 2008Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity164 cited
  • 2013Cake cutting156 cited
  • 2015Spliddit138 cited
  • 2014Fair enough138 cited
  • 2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
  • 2017Approximation Algorithms for Computing Maximin Share Allocations125 cited
  • 2015Fair assignment of indivisible objects under ordinal preferences121 cited
  • 2014Characterizing conflicts in fair division of indivisible goods using a scale of criteria113 cited
  • 2007An approximation algorithm for max-min fair allocation of indivisible goods102 cited
  • 2011Optimal Envy-Free Cake Cutting91 cited

Cited by

  • 2017Algorithms for Max-Min Share Fair Allocation of Indivisible Chores82 cited

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

  • 2020Approximation Algorithms for Maximin Fair Division74 cited
  • 2020An Improved Approximation Algorithm for Maximin Shares70 cited
  • 2019Fair Allocation of Indivisible Goods to Asymmetric Agents70 cited
  • 2018Fair Division Under Cardinality Constraints60 cited