相关论文: Cake Cutting Mechanisms

We consider the classic problem of envy-free division of a heterogeneous good ("cake") among several agents. It is known that, when the allotted pieces must be connected, the problem cannot be solved by a finite algorithm for 3 or more…

The classic cake cutting problem concerns the fair allocation of a heterogeneous resource among interested agents. In this paper, we study a public goods variant of the problem, where instead of competing with one another for the cake, the…

We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize the existence of a connected strongly-proportional allocation…

We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the…

We propose an online form of the cake cutting problem. This models situations where agents arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the…

The problem of fair division known as "cake cutting" has been the focus of multiple papers spanning several decades. The most prominent problem in this line of work has been to bound the query complexity of computing an envy-free outcome in…

In the classic problem of fair cake-cutting, a single interval ("cake") has to be divided among n agents with different value measures, giving each agent a single sub-interval with a value of at least 1/n of the total. This paper studies a…

We consider the classic problem of fairly dividing a heterogeneous good ("cake") among several agents with different valuations. Classic cake-cutting procedures either allocate each agent a collection of disconnected pieces, or assume that…

Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for different parts of the cake (i.e. one agent may like chocolate…

We study the cake-cutting problem when agents have single-peaked preferences over the cake. We show that a recently proposed mechanism by Wang-Wu (2019) to obtain envy-free allocations can yield large welfare losses. Using a simplifying…

In this article we study a cake cutting problem. More precisely, we study symmetric fair division algorithms, that is to say we study algorithms where the order of the players do not influence the value obtained by each player. In the first…

We consider the well-studied cake cutting problem in which the goal is to find an envy-free allocation based on queries from $n$ agents. The problem has received attention in computer science, mathematics, and economics. It has been a major…

We study the disproportionate version of the classical cake-cutting problem: how efficiently can we divide a cake, here $[0,1]$, among $n$ agents with different demands $\alpha_1, \alpha_2, \dots, \alpha_n$ summing to $1$? When all the…

The central question in the game theory of cake-cutting is how to fairly distribute a finite resource among multiple players. Most research has focused on how to do this for a heterogeneous cake in a situation where the players do not have…

A cake has to be divided fairly among $n$ agents. When all agents have equal entitlements, it is known that such a division can be implemented with $n-1$ cuts. When agents may have different entitlements, the paper shows that at least $2 n…

In this note we study a problem of fair division in the absence of full information. We give an algorithm which solves the following problem: n $\ge$ 2 persons want to cut a cake into n shares so that each person will get at least 1/n of…

We characterize methods of dividing a cake between two bidders in a way that is incentive-compatible and Pareto-efficient. In our cake cutting model, each bidder desires a subset of the cake (with a uniform value over this subset), and is…

The paper considers fair allocation of resources that are already allocated in an unfair way. This setting requires a careful balance between the fairness considerations and the rights of the present owners. The paper presents re-division…

A perfectly divisible cake is to be divided among a group of agents. Each agent is entitled to a share between zero and one, and these entitlements are compatible in that they sum to one. The mediator does not know the preferences of the…

We study searching and sorting in rounds motivated by a fair division question: given a cake cutting problem with $n$ players, compute a fair allocation in at most $k$ rounds of interaction with the players. Rounds interpolate between the…