Two auction mechanisms are studied in which players compete with one another for an exogenously determined prize by independently submitting integer bids in some discrete and commonly known strategy space specified by the auctioneer. In the unique lowest (highest) bid auction game, the winner of...

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

Volunteer's dilemmas that evolve over time are presented and modeled as noncooperative n-person games in extensive form with symmetric players, discrete time, finite horizon, and complete information. Volunteering is costly, thereby giving rise to free riding. Reflecting on the observation that...

Vickrey's seminal analysis of urban traffic congestion assumes a continuum of commuters acting selfishly and a continuous strategy space. We propose a discrete version of his model that assumes a finite number of commuters and a discrete strategy space. We then present an algorithm for...