We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision. -- Fair Division ; Maxmin Allocation ; Kalai...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

A strategy is obviously dominant if, for any deviation, at any information set where both strategies first diverge, the best outcome under the deviation is no better than the worst outcome under the dominant strategy. A mechanism is obviously strategy-proof (OSP) if it has an equilibrium in...

The paper reports on an experiment on two-player double-auction bargaining with private values. We consider a setting with discrete two-point overlapping distributions of traders' valuations, in which there exists a fully efficient equilibrium. We show that if there are traders that behave...

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive...

We consider deterministic dominant strategy implementation in multidimensional dichotomous domains in private values and quasi-linear utility setting. In such multidimensional domains, an agent’s type is characterized by a single number, the value of the agent, and a non-empty set of...

We experimentally compare a simplified version of two mechanisms that implement the Shapley value as an (ex ante) equilibrium outcome of a noncooperative bargaining procedure: one proposed by Hart and Mas-Colell (1996, H-MC) and the other by Perez-Castrillo and Wettstein (2001, PC-W). While H-MC...

Least-Unmatched Price Auctions have become a popular format of TV and radio shows. Increasingly, they are also applied in internet trading. In these auctions the lowest single (unique) bid wins. We analyze the game-theoretic solution of least unmatched price auctions when prize, bidding cost and...