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