Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...

We provide two novel dynamic double auction (DA) mechanisms for a class of economies and study their convergence property to competitive equilibrium. For DA mechanisms, we find a parameter on the two sequences of the marginal bid increments (bid step-size) and ask decrements (ask step-size) that...

A buyer seeking to outsource production may be able to find ways to reduce a potential supplier's cost, e.g., by suggesting improvements to the supplier's proposed production methods. We study how a buyer could use such "cost reduction investigations" by proposing a three-step supplier selection...

We model a spectrum auction where firms purchase units to participate in a constrained, multi-product, downstream market. We use dynamic programming techniques to numerically solve for the optimal bidding strategy in a clock auction. Firms value constraining competitor market power, so...

Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...

We consider truthful implementation of the socially efficient allocation in an independent private-value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the...

We consider truthful implementation of the socially efficient allocation in an independent private-value environment in which agents receive private information over time. We propose a suitable generalization of the pivot mechanism, based on the marginal contribution of each agent. In the...

We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of...

Analysis of welfare in auctions comes traditionally via one of two approaches: precise but fragile inference of the exact details of a setting from data or robust but coarse theoretical price of anarchy bounds that hold in any setting. As markets get more and more dynamic and bidders become more...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...