SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Online Cake Cutting
11 references·2 citing·35 second hop
Online Cake Cutting (2011)Online Cake CuttingTruth, justice, and cake cutting (2012)Truth, justice, and cake cutt…Uncertainty in preference elicitation and aggregation (2007)Uncertainty in preference eli…Incompleteness and incomparability in preference aggregation (2007)Incompleteness and incomparab…Better Ways to Cut a Cake (2006)Better Ways to Cut a CakeHow not to do it (2005)How not to do itCake-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…Cake-Cutting Algorithms (1998)Cake-Cutting AlgorithmsFair Division (1996)Fair DivisionThe Fair Division of a Fixed Supply Among a Growing Population (1983)The Fair Division of a Fixed …How to Cut A Cake Fairly (1961)How to Cut A Cake FairlyUsing Auctions to Allocate Transportation Requests for Demand Responsive Transit Systems (2013)Using Auctions to Allocate Tr…No agent left behind: dynamic fair division of multiple resources (2013)No agent left behind: dynamic…On the Rationale of Group Decision-making (1948)The computational difficulty of manipulating an election (1989)Single transferable vote resists strategic voting (1991)Eliciting Single-Peaked Preferences Using Comparison Queries (2009)Swap Bribery (2009)Campaigns for lazy voters: Truncated ballots (2012)The Bargaining Problem (1950)Other Solutions to Nash's Bargaining Problem (1975)Stability and the Nash solution (1988)Chapter 35 Cooperative models of bargaining (1994)A characterization of the Shapley value in queueing problems (2003)Games and Decisions (2015)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)Interpersonal Comparisons of Well-Being (1991)Proportional pie-cutting (2007)Equitable Allocations of Indivisible Goods (2019)Survey of Preference Elicitation Methods (2004)Voting procedures with incomplete preferences (2005)Aggregating Partially Ordered Preferences (2008)Determining possible and necessary winners under common voting rules given partial orders (2008)A multivariate complexity analysis of determining possible winners given incomplete votes (2009)Rental Harmony: Sperner's Lemma in Fair Division (1999)Fair Allocation Rules (2011)An Envy-Free Cake Division Protocol (1995)Fair division: From cake-cutting to dispute resolution (1996)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)The Unreasonable Fairness of Maximum Nash Welfare (2016)Allocating indivisible goods (2005)Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity (2008)
this work references cited by second hop

References

  • 1998Fair Division: From Cake-Cutting to Dispute Resolution.751 cited
  • 1996Fair Division670 cited
  • 1961How to Cut A Cake Fairly385 cited
  • 2000Cake-Cutting Algorithms: Be Fair if You Can.343 cited
  • 1998Cake-Cutting Algorithms226 cited
  • 1983The Fair Division of a Fixed Supply Among a Growing Population214 cited
  • 2012Truth, justice, and cake cutting187 cited
  • 2007Uncertainty in preference elicitation and aggregation139 cited
  • 2006Better Ways to Cut a Cake76 cited
  • 2007Incompleteness and incomparability in preference aggregation76 cited
  • 2005How not to do it31 cited

Cited by

  • 2013No agent left behind: dynamic fair division of multiple resources56 cited
  • 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