SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
10 references·13 citing·36 second hop
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity (2008)Efficiency and Envy-freeness in Fair Divi…Combinatorial Auctions (2014)Combinatorial AuctionsMarginal contribution nets (2005)Marginal contribution netsBidding Languages for Combinatorial Auctions (2005)Bidding Languages for Combina…On approximately fair allocations of indivisible goods (2004)On approximately fair allocat…Bidding languages for combinatorial auctions (2001)Bidding languages for combina…Cake-Cutting Algorithms: Be Fair if You Can. (2000)Cake-Cutting Algorithms: Be F…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…Computationally Manageable Combinational Auctions (1998)Computationally Manageable Co…Cake-Cutting Algorithms (1998)Cake-Cutting AlgorithmsEquity: In Theory and Practice (1995)Equity: In Theory and PracticeFair division of indivisible goods: Recent progress and open questions (2023)Fair division of indivisible …Fair Division in the Internet Age (2019)Fair Division in the Internet…Fair Public Decision Making (2017)Fair Public Decision MakingWhen Can the Maximin Share Guarantee Be Guaranteed? (2016)When Can the Maximin Share Gu…Fair assignment of indivisible objects under ordinal preferences (2015)Fair assignment of indivisibl…The Computational Rise and Fall of Fairness (2014)The Computational Rise and Fa…Computing desirable partitions in additively separable hedonic games (2012)Computing desirable partition…Computational Social Choice (2012)Computational Social ChoiceThe Efficiency of Fair Division (2011)The Efficiency of Fair Divisi…Making decisions based on the preferences of multiple agents (2010)Making decisions based on the…Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods (2010)Fair Division under Ordinal P…On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences (2009)On the Complexity of Efficien…Preference Handling in Combinatorial Domains: From AI to Social Choice (2008)Preference Handling in Combin…Social Choice and Individual Values. (1951)The Theory of Committees and Elections. (1959)Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions (1975)Complexity of Judgment Aggregation (2012)Judgment Aggregation: A Primer (2014)On Voting and Facility Location (2016)A Combinatorial Auction Mechanism for Airport Time Slot Allocation (1991)Decisions with Multiple Objectives: Preferences and Value Tradeoffs. (1994)Bundling equilibrium in combinatorial auctions (2003)Logical Preference Representation and Combinatorial Vote (2004)Resource allocation and the public sector (1967)Equity, envy, and efficiency (1974)A Short Introduction to Computational Social Choice (2007)Almost Envy-Freeness with General Valuations (2018)10.1016/b978-044488002-4/50004-x (2000)Algorithmic Mechanism Design (2001)The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics (2002)Combinatorial Auctions: A Survey (2003)A Course in Game Theory (1994)On the Complexity of Cooperative Solution Concepts (1994)Computational Aspects of Cooperative Game Theory (2011)Graphical Models for Game Theory (2013)Coalition structure generation: A survey (2015)Rental Harmony: Sperner's Lemma in Fair Division (1999)Fair Allocation Rules (2011)Truth, justice, and cake cutting (2012)The Unreasonable Fairness of Maximum Nash Welfare (2016)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)Chapter 2 Measurement of inequality (2000)Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey (2003)Fair adaptation to climate change (2005)What Have We Learned from Market Design? (2008)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Computational Aspects of Cooperative Game Theory (2012)Allocating indivisible goods (2005)Cake cutting (2013)
this work references cited by second hop

References

  • 1998Computationally Manageable Combinational Auctions1,024 cited
  • 2014Combinatorial Auctions923 cited
  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1995Equity: In Theory and Practice658 cited
  • 2004On approximately fair allocations of indivisible goods537 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1998Cake-Cutting Algorithms226 cited
  • 2005Marginal contribution nets194 cited
  • 2001Bidding languages for combinatorial auctions164 cited
  • 2005Bidding Languages for Combinatorial Auctions152 cited

Cited by

  • 2012Computational Social Choice162 cited
  • 2011The Efficiency of Fair Division144 cited
  • 2017Fair Public Decision Making140 cited
  • 2015Fair assignment of indivisible objects under ordinal preferences121 cited
  • 2012Computing desirable partitions in additively separable hedonic games112 cited
  • 2023Fair division of indivisible goods: Recent progress and open questions96 cited

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

2010
Making decisions based on the preferences of multiple agents
93 cited
  • 2019Fair Division in the Internet Age92 cited
  • 2016When Can the Maximin Share Guarantee Be Guaranteed?87 cited
  • 2009On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences71 cited
  • 2008Preference Handling in Combinatorial Domains: From AI to Social Choice68 cited
  • 2014The Computational Rise and Fall of Fairness67 cited
  • 2010Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods66 cited