Assume two players, A and B, must divide a set of indivisible items that each strictly ranks from best to worst. If the number of items is even, assume that the players desire that the allocations be balanced (each player gets half the items), item-wise envy-free (EF), and Pareto-optimal (PO)....

We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envy-free, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are...

A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, there is always a perfect division—one that is efficient (Pareto-optimal), envy-free, and equitable—which can be effected with a finite number of cuts under certain mild conditions; this is not...

Cutting a cake -- or any heterogeneous, divisible good -- fairly has received much attention in recent years, but fair division of a pie into wedge-shaped sectors has received far less. Whereas cake-cutting is applicable to land division, pie-cutting is more applicable to the division of an...

We propose a procedure for dividing indivisible items between two players in which each player ranks the items from best to worst. It ensures that each player receives a subset of items that it values more than the other player's complementary subset, given that such an envy-free division is...

A cake is a metaphor for a heterogeneous, divisible good. When two players divide such a good, there is always a perfect division — one that is efficient (Pareto-optimal), envy-free, and equitable — which can be effected with a finite number of cuts under certain mild conditions; this is not...

We describe a simple 2-stage mechanism whereby for two bargainers, a Buyer and a Seller, it is a weakly dominant strategy to report their reservation prices in the 1st stage. If the Buyer reports a higher price than the Seller, then the referee announces that there is the possibility for trade,...

Assume in a 2-person game that one player, Predictor (P), does not have a dominant strategy but can predict with probability p 1/2 the strategy choice of an opponent, Predictee (Q). Q chooses a strategy that maximizes her expected payoff, given that she knows p—but not P's prediction—and...

We analyze a particular episode of a popular British TV game show, “Golden Balls,” in which one of the two contestants lied about what he intended to do, which had the salutary effect of inducing both contestants to cooperate in what is normally a Prisoners' Dilemma (PD), wherein one or both...