Related papers: Design Schemes for Fair Dice
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…
A fair sack is a finite set of independent dice, not required to be fair and allowed to have any number of sides, for which all totals are equally likely. These have been studied for over 60 years. Most results restrict the possible orders…
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 consider the problem of fairly dividing a two dimensional heterogeneous good among multiple players. Applications include division of land as well as ad space in print and electronic media. Classical cake cutting protocols primarily…
We show how to simulate a roll of a fair $n$-sided die by one flip of a biased coin with probability $1/n$ of coming up heads, followed by $3\lfloor\log_2 n \rfloor+1$ flips of a fair coin.
What are the face-probabilities of a cuboidal die, i.e. a die with different side-lengths? This paper introduces a model for these probabilities based on a Gibbs distribution. Experimental data produced in this work and drawn from the…
Two possibly unfair $n$-sided dice, both labelled $1, 2, \ldots, n$, are rolled, and the sum is recorded. How should the dice's sides be weighted so that the resulting sum is closest to the uniform distribution on $2, 3, \ldots, 2n$? We…
We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space ("cake") and non-atomic, additive individual preference measures - or utilities - we show that…
Fair division with unequal shares is an intensively studied recourse allocation problem. For $ i\in [n] $, let $ \mu_i $ be an atomless probability measure on the measurable space $(C,\mathcal{S}) $ and let $ t_i $ be positive numbers…
The problem of creating a three-sided dice with the probability of it landing on each of its sides being equal to 1/3 has been around for many years. Various approaches have been attempted, but as different authors achieved at different…
Classic cake-cutting algorithms enable people with different preferences to divide among them a heterogeneous resource (``cake''), such that the resulting division is fair according to each agent's individual preferences. However, these…
These notes describe some results on dice comparisons when changing the numbers on the faces while the sum of all the face stay the same.
Consider n straight line cuts of a circular pizza made so as to maximize the number of pieces. We investigate how fair such a maximal division may be and how many slices are obtained if the cuts are successfully made with a certain…
We discuss coin-weighing problems with a new type of coin: a chameleon. A chameleon coin can mimic a fake or a real coin, and it can choose which coin to mimic for each weighing independently. We consider a mix of $N$ coins that include…
We study the fair division of a continuous resource, such as a land-estate or a time-interval, among pre-specified groups of agents, such as families. Each family is given a piece of the resource and this piece is used simultaneously by all…
An unceasing problem of our prevailing society is the fair division of goods. The problem of proportional cake cutting focuses on dividing a heterogeneous and divisible resource, the cake, among $n$ players who value pieces according to…
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…
The difference set of an outcome in an auction is the set of types that the auction mechanism maps to the outcome. We give a complete characterization of the geometry of the difference sets that can appear for a dominant strategy incentive…
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 solvency cone is a polyhedral convex cone which is used in Mathematical Finance to model proportional transaction costs. It consists of those portfolios which can be traded into nonnegative positions. In this note, we provide a…