Related papers: Counterexamples in Cake-Cutting
Without additional hypotheses, Proposition 7.1 in Brams and Taylor's book "Fair Division" (Cambridge University Press, 1996) is false, as are several related Pareto-optimality theorems of Brams, Jones and Klamler in their 2006 cake-cutting…
In this article we suggest a model of computation for the cake cutting problem. In this model the mediator can ask the same queries as in the Robertson-Webb model but he or she can only perform algebraic operations as in the Blum-Shub-Smale…
This paper is devoted to present two counterexamples to the theorem from \cite{MK} Maria R., Katherine T. M., Bernardo S. M., Extremal graphs with bounded vertex bipartiteness number, Linear Algebra Appl. 493 (2016) 28-36. Moreover, 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…
In this short note we give counterexamples to several results related to extension theorems published recently.
Cake-cutting is a playful name for the fair division of a heterogeneous, divisible good among agents, a well-studied problem at the intersection of mathematics, economics, and artificial intelligence. The cake-cutting literature is rich and…
Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource. Recently, it was shown that for any number of players with arbitrary preferences over a cake, it is possible to…
We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.
We discuss a construction that gives counterexamples to various questions of unique determination of convex bodies.
We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare…
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…
In this paper, we give a counter-example, in the general case, Kronecker theorem will derive contradiction. Kronecker theorem be correct after removing some conditions.
In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.
We study the problem of fair cake-cutting where each agent receives a connected piece of the cake. A division of the cake is deemed fair if it is equitable, which means that all agents derive the same value from their assigned piece. Prior…
In this extended abstract, we carefully examine a purported counterexample to a postulate of iterated belief revision. We suggest that the example is better seen as a failure to apply the theory of belief revision in sufficient detail. The…
To divide a cake into equal sized pieces most people use a knife and a mixture of luck and dexterity. These attempts are often met with varying success. Through precise geometric constructions performed with the knife replacing Euclid's…
This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.
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 the first chapter of their classic book "Concrete Mathematics", Graham, Knuth, and Patashnik consider the maximum number of pieces that can be obtained from a pancake by making n cuts with a knife blade that is straight, or bent into a…
A fundamental result in cake cutting states that for any number of players with arbitrary preferences over a cake, there exists a division of the cake such that every player receives a single contiguous piece and no player is left envious.…