SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
No agent left behind: dynamic fair division of multiple resources
8 references·1 citing·34 second hop
No agent left behind: dynamic fair division of multiple resources (2013)No agent left behind: dynamic fair divisi…Truth, justice, and cake cutting (2012)Truth, justice, and cake cutt…Fair allocation without trade (2012)Fair allocation without tradeBeyond dominant resource fairness (2012)Beyond dominant resource fair…Online Cake Cutting (2011)Online Cake CuttingThou shalt covet thy neighbor's cake (2009)Thou shalt covet thy neighbor…Fair Division and Collective Welfare (2003)Fair Division and Collective …Fair Queuing and Other Probabilistic Allocation Methods (2002)Fair Queuing and Other Probab…Fair Division: From Cake-Cutting to Dispute Resolution. (1998)Fair Division: From Cake-Cutt…Using Auctions to Allocate Transportation Requests for Demand Responsive Transit Systems (2013)Using Auctions to Allocate Tr…Aggregation of Utility Functions (1961)Interpersonal comparisons of utility: Why and how they are and should be made (1991)Existence of an equilibrium for a competitive economy (2008)Mechanism design for fair division (2013)Strategyproof allocation of discrete jobs on multiple machines (2014)Beyond Dominant Resource Fairness (2015)The problem of fair division (1948)An Envy-Free Cake Division Protocol (1995)Cake-Cutting Algorithms: Be Fair if You Can. (2000)How to Cut a Cake Before the Party Ends (2013)A discrete and bounded envy-free cake cutting protocol for four agents (2016)On Maxsum Fair Cake Divisions (2021)Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing (1962)Serial Cost Sharing (1992)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)A problem of rights arbitration from the Talmud (1982)Game theoretic analysis of a bankruptcy problem from the Talmud (1985)Equity: In Theory and Practice (1995)A New Solution to the Random Assignment Problem (2001)Algorithmic Mechanism Design (2001)Cake cutting (2013)A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents (2016)Society-in-the-loop: programming the algorithmic social contract (2017)How to Cut A Cake Fairly (1961)Fair Division (1996)Equity, envy, and efficiency (1974)The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes (2011)Fair enough (2014)No Agent Left Behind: Dynamic Fair Division of Multiple Resources (2014)The Unreasonable Fairness of Maximum Nash Welfare (2016)Towards a Genuine Economic and Monetary Union (2016)The sound of silence in prisoner's dilemma and dictator games (1999)On approximately fair allocations of indivisible goods (2004)Is It Good to Cooperate? Testing the Theory of Morality-as-Cooperation in 60 Societies (2019)
this work references cited by second hop

References

  • 2003Fair Division and Collective Welfare815 cited
  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 2012Truth, justice, and cake cutting187 cited
  • 2012Beyond dominant resource fairness162 cited
  • 2012Fair allocation without trade97 cited
  • 2009Thou shalt covet thy neighbor's cake71 cited
  • 2002Fair Queuing and Other Probabilistic Allocation Methods66 cited
  • 2011Online Cake Cutting62 cited

Cited by

  • 2013Using Auctions to Allocate Transportation Requests for Demand Responsive Transit Systems2 cited

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