The present note analyzes the Simultaneous Ascending Bid Auction with arbitrarily many bidders with decreasing marginal valuations under complete information. We show that the game is solvable by iterated elimination of weakly dominated strategies if the efficient allocation assigns at least one...

The study of combinatorial auctions -- auctions in which bidders can bid on combinations of items or "packages" -- draws on the disciplines of economics, operations research, and computer science. This landmark collection integrates these three perspectives, offering a state-of-the art survey of...

The study of combinatorial auctions -- auctions in which bidders can bid on combinations of items or "packages" -- draws on the disciplines of economics, operations research, and computer science. This landmark collection integrates these three perspectives, offering a state-of-the art survey of...

This paper investigates how heterogeneity in contestants' investment costs affects the competition intensity in a dynamic elimination contest. Theory predicts that the absolute level of investment costs has no effect on the competition intensity in homogeneous interactions. Relative cost...

Credence goods markets – like for health care or repair services – with their informational asymmetries between sellers and customers are prone to fraudulent behavior of sellers and resulting market inefficiencies. We present the first model that considers both diagnostic uncertainty of...

Credence goods markets – like for health care or repair services – with their informational asymmetries between sellers and customers are prone to fraudulent behavior of sellers and resulting market inefficiencies. We present the first model that considers both diagnostic uncertainty of...