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

In January 2007, first evidence of an asymmetric pass-through of CO2 emission allowance prices was reported for the German electricity spot market. This paper explores the theoretical basis for such an asymmetry in the context of a supply function bidding duopoly. It interprets fluctuating...

We consider a dynamic auction environment with a long-lived seller and short-lived buyers mediated by a third party. A mediator has incomplete information about traders' values and selects an auction mechanism to maximize her expected revenue. We characterize mediator-optimal mechanisms and show...

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

We consider a dynamic auction environment with a long-lived seller and short-lived buyers mediated by a third party. A mediator has incomplete information about traders' values and selects an auction mechanism to maximize her expected revenue. We characterize mediator-optimal mechanisms and show...

We study full surplus extraction and implementation in dynamic environments. We exploit intertemporal correlations of agents' types to construct within-period ex post incentive compatible mechanisms. First, we formulate one-shot environments, in which a single agent has a hidden type and the...