SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Fair Division Under Cardinality Constraints
9 references·1 citing·40 second hop
Fair Division Under Cardinality Constraints (2018)Fair Division Under Cardinality Constrain…Approximation Algorithms for Maximin Fair Division (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 …Handbook of Computational Social Choice (2016)Handbook of Computational Soc…Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation (2016)Course Match: A Large-Scale I…Characterizing conflicts in fair division of indivisible goods using a scale of criteria (2015)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…Equity, envy, and efficiency (1974)Equity, envy, and efficiencyWeighted Envy-Freeness in Indivisible Item Allocation (2020)Weighted Envy-Freeness in Ind…Fair division: From cake-cutting to dispute resolution (1996)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)Resource allocation and the public sector (1967)General competitive analysis (1971)Collective Choice and Social Welfare (1972)Equity, Arrow's Conditions, and Rawls' Difference Principle (1976)Inequality Reexamined (1995)Fairness, Responsibility, and Welfare (2008)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)Finding Fair and Efficient Allocations (2018)Fair Division and Collective Welfare (2003)A Little Charity Guarantees Almost Envy-Freeness (2019)Fair Allocation of Indivisible Goods and Chores (2019)EFX Exists for Three Agents (2020)The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics (2002)School Choice: A Mechanism Design Approach (2003)Combinatorial Auctions (2005)Fair algorithms for selecting citizens’ assemblies (2021)A theory of justice original editionAxioms of Cooperative Decision Making (1988)Fair assignment of indivisible objects under ordinal preferences (2015)Approximation Algorithms for Computing Maximin Share Allocations (2017)Collective Choice and Social Welfare (2017)Fair Allocation of Indivisible Goods (2018)Social Choice and Individual Values (1952)Game theoretic analysis of a bankruptcy problem from the Talmud (1985)Moral Decision Making Frameworks for Artificial Intelligence (2017)Social choice ethics in artificial intelligence (2017)A Voting-Based System for Ethical Decision Making (2018)A Short Introduction to Computational Social Choice (2007)Almost Envy-Freeness with General Valuations (2018)
this work references cited by second hop

References

  • 1974Equity, envy, and efficiency1,027 cited
  • 2011The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes767 cited
  • 2004On approximately fair allocations of indivisible goods537 cited
  • 2016Handbook of Computational Social Choice439 cited
  • 2016The Unreasonable Fairness of Maximum Nash Welfare346 cited
  • 2016Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation141 cited
  • 2015Characterizing conflicts in fair division of indivisible goods using a scale of criteria134 cited
  • 2017Approximation Algorithms for Maximin Fair Division104 cited
  • 2016When Can the Maximin Share Guarantee Be Guaranteed?87 cited

Cited by

  • 2020Weighted Envy-Freeness in Indivisible Item Allocation58 cited

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