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 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...

In an incomplete information setting, we analyze the sealed bid auction proposed by Knaster (cf. Steinhaus (1948)). This procedure was designed to efficiently and fairly allocate multiple indivisible items when participants report their valuations truthfully. In equilibrium, players do not...

This paper reports the experimental results of implicit pre-play communication on the equilibrium selection in threshold public goods game experiments. The existence of an asset market in which the right to participate in a public goods game with a provision point is auctioned off among a larger...

In first- and second-price private value auctions with sequential bidding, second movers may discover the first movers' bid. Equilibrium behavior in the first-price auction is mostly unaffected but there are multiple equilibria in the second-price auction. Consequently, comparative statics...

In this paper, we investigate behavior in two-player sequential-move contests with complete and incomplete information about the value of the prize, theoretically and experimentally. First, we describe a Bayesian equilibrium of a sequential contest in which both players have private prize...