Based on a model introduced by Kaminsky, Luks, and Nelson (1984), we consider a zero-sum allocation game called the Gladiator Game, where two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators' strengths. Each team's...

We consider a model of bottleneck congestion in discrete time with a penalty cost for being late. This model can be applied to several situations where agents need to use a capacitated facility in order to complete a task before a hard deadline. A possible example is a situation where commuters...

We consider a Hotelling game where a finite number of retailers choose a location, given that their potential customers are distributed on a network. Retailers do not compete on price but only on location, therefore each consumer shops at the closest store. We show that when the number of...