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

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

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine spillover effects that depend on the rank-order of her decision...

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

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

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine spillover effects that depend on the rank-order of her decision...