SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Comparing Approximate Relaxations of Envy-Freeness
16 references·2 citing·29 second hop
Comparing Approximate Relaxations of Envy-Freeness (2018)Comparing Approximate Relaxations of Envy…Finding Fair and Efficient Allocations (2018)Finding Fair and Efficient Al…Almost Envy-Freeness with General Valuations (2018)Almost Envy-Freeness with Gen…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 …Fair Allocation of Indivisible Goods (2016)Fair Allocation of Indivisibl…Cake Cutting Algorithms (2016)Cake Cutting AlgorithmsCharacterizing 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…Fair division: From cake-cutting to dispute resolution (1996)Fair division: From cake-cutt…Equity, envy, and efficiency (1974)Equity, envy, and efficiencyResource allocation and the public sector (1967)Resource allocation and the p…Maximum Nash Welfare and Other Stories About EFX (2020)Maximum Nash Welfare and Othe…Local envy-freeness in house allocation problems (2019)Local envy-freeness in house …The problem of fair division (1948)The Art and Science of Negotiation (1983)The Art and Science of Negotiation. (1984)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)Towards a Genuine Economic and Monetary Union (2016)General competitive analysis (1971)Collective Choice and Social Welfare (1972)Is more always better?: A survey on positional concerns (1998)Which Is the Fairest One of All? A Positive Analysis of Justice Theories (2003)Fairness, Responsibility, and Welfare (2008)Fair Division: From Cake-Cutting to Dispute Resolution. (1998)A Short Introduction to Computational Social Choice (2007)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)Fair Public Decision Making (2017)Fair Division (1996)Fair Allocation of Indivisible Goods (2018)A Little Charity Guarantees Almost Envy-Freeness (2019)Fair division of indivisible goods: Recent progress and open questions (2023)Rental Harmony: Sperner's Lemma in Fair Division (1999)Fair Division in the Internet Age (2019)2. Public Goods: A Survey of Experimental Research (1995)Equality of Opportunity (1998)The Theory of Incentives: The Principal-Agent Model (2001)
this work references cited by second hop

References

  • 1967Resource allocation and the public sector1,086 cited
  • 1974Equity, envy, and efficiency1,056 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
  • 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
  • 2018Almost Envy-Freeness with General Valuations193 cited
  • 2018Finding Fair and Efficient Allocations174 cited
  • 2016Fair Allocation of Indivisible Goods170 cited
  • 2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
  • 2016Cake Cutting Algorithms127 cited
  • 2017Approximation Algorithms for Computing Maximin Share Allocations125 cited
  • 2014Characterizing conflicts in fair division of indivisible goods using a scale of criteria113 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

  • 2019Local envy-freeness in house allocation problems52 cited
  • 2020Maximum Nash Welfare and Other Stories About EFX52 cited