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

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

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

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

Whether behavior converges toward rational play or fair play in repeated ultimatum games depends on which player yields first. If responders concede first by accepting low offers, proposers would not need to learn to offer more, and play would converge toward unequal sharing. By the same token,...

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

Disagreements between psychologists and economists about the need for and size of financial incentives continue to be hotly discussed. We examine the effects of financial incentives in a class of interactive decision making situations, called centipede games, in which mutual trust is essential...

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