Two types of auction were introduced on the Internet a few years ago and have rapidly been gaining widespread popularity. In both auctions, players compete for an exogenously determined prize by independently choosing an integer in some finite and common strategy space specified by the...

We study a class of single-server queueing systems with a finite population size, FIFO queue discipline, and no balking or reneging. In contrast to the predominant assumptions of queueing theory of exogenously determined arrivals and steady state behavior, we investigate queueing systems with...

We study both theoretically and experimentally the decisions players make in two queueing games with batch service. In both games, players are asked to independently decide when to join a discrete-time queue to receive service, or they may simply choose not to join it at all. Equilibrium...

We extend the sealed-bid k-double-auction mechanism from a single- to two-round game where offers are made simultaneously during each round. If an agreement is reached on round 1, then the traders realize their profit and the game is over. If not, equipped with information about the round 1 bids...

We study a class of queueing problems with endogenous arrival times that we formulate as non-cooperative n-person games in normal form with discrete strategy spaces, fixed starting and closing times, and complete information. With multiple equilibria in pure strategies, these queueing games give...