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

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

This paper considers all-pay contests in which the relationship between bids and allocation reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...

This paper introduces a class of contest models in which each player decides when to stop a privately observed Brownian motion with drift and incurs costs depending on his stopping time. The player who stops his process at the highest value wins a prize. We prove existence and uniqueness of a...

This paper provides a different approach to establish the uniqueness of equilibrium in Tullock con- tests between two players with asymmetric valuations, when the discriminatory power r is between 1 and 2. Our result complements that of Ewerhart (2017) in Ölling up the remaining gap in the...

We develop a model of contests on networks. Each player is “connected” to a set of contests and exerts a single effort to increase the probability of winning each contest to which she is connected. We characterize equilibria under the Tullock contest success function and explore how behavior...

We generalize Klumpp, Konrad and Solomon's model (KKS Model) to multi-contestant sequential Colonel Blotto Games with prize functions where any contestant's prizes only depend on this contestant's own number of winning rounds. We show that with weakly monotonic prize functions and CSFs...

This paper considers all-pay contests in which the relationship between bids and allocations reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

I investigate the decision problem of a player in a game of incomplete information who faces uncertainty about the other players' strategies. I propose a new decision criterion which works in two steps. First, I assume common knowledge of rationality and eliminate all strategies which are not...