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 report the results of an experiment on two-stage contests with budget-constrained agents competing to win an exogenously determined prize. We study a class of two-stage contests where in stage 1 agents first compete within their own groups by expending resources, and in stage 2 the winners of...

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

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