相关论文: Tight Lower Bounds for Unequal Division

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…

The classic cake-cutting problem provides a model for addressing fair and efficient allocation of a divisible, heterogeneous resource (metaphorically, the cake) among agents with distinct preferences. Focusing on a standard formulation of…

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

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…

We initiate the study of multi-layered cake cutting with the goal of fairly allocating multiple divisible resources (layers of a cake) among a set of agents. The key requirement is that each agent can only utilize a single resource at each…

In this article we propose a probabilistic framework in order to study the fair division of a divisible good, e.g., a cake, between n players. Our framework follows the same idea than the ''Full independence model'' used in the study of…

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…

The fair division literature in economics considers how to divide resources between multiple agents such that the allocation is envy-free: each agent receives their favorite piece. Researchers have developed a variety of fair division…

We consider multi-layered cake cutting in order to fairly allocate numerous divisible resources (layers of cake) among a group of agents under two constraints: contiguity and feasibility. We first introduce a new computational model in a…

In this paper, we show that every graph with $m$ edges admits a 3-partition such that \[ \max_{1 \leq i \leq 3} e(V_i) \leq \frac{m}{9} + \frac{1}{9}h(m) \quad \text{and} \quad e(V_1, V_2, V_3) \geq \frac{2}{3}m + \frac{1}{3}h(m), \] where…

We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an additional requirement that the shares that different agents receive should be sufficiently separated from one another. This captures, for…

We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked…

This article deals with the cake cutting problem. In this setting, there exists two notions of fair division: proportional division (when there are n players, each player thinks to get at least 1/n of the cake) and envy-free division (each…

We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…

Envy-free cake-cutting protocols procedurally divide an infinitely divisible good among a set of agents so that no agent prefers another's allocation to their own. These protocols are highly complex and difficult to prove correct. Recently,…

The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and…

We study the fair division problem on divisible heterogeneous resources (the cake cutting problem) with strategic agents, where each agent can manipulate his/her private valuation in order to receive a better allocation. A…

We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. While it is known that no finite envy-free algorithm exists in…

Let $X$ be a semistable curve and $L$ a line bundle whose multidegree is uniform, i.e., in the range between those of the structure sheaf and the dualizing sheaf of $X$. We establish an upper bound for $h^0(X,L)$, which generalizes the…

Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…