We investigate a version of the classic Colonel Blotto game in which individual battles may have different values. Two players allocate a fixed budget across battlefields and each battlefield is won by the player who allocates the most to that battlefield. The winner of the game is the player...

We consider mechanisms for allocating a common-value prize between two players in an incomplete information setting. In this setting, each player receives an independent private signal about the prize value. The signals are from a discrete distribution and the value is increasing in both...

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 investigate a version of the classic Colonel Blotto game in which individual battles may have different values. Two players allocate a fixed budget across battlefields and each battlefield is won by the player who allocates the most to that battlefield. The winner of the game is the player...