相关论文: Empirical bias of extreme-price auctions: analysis
We experimentally evaluate the comparative performance of the winner-bid, average-bid, and loser-bid auctions for the dissolution of a partnership. The analysis of these auctions based on the empirical equilibrium refinement of Velez and…
We consider the computational complexity of computing Bayes-Nash equilibria in first-price auctions, where the bidders' values for the item are drawn from a general (possibly correlated) joint distribution. We show that when the values and…
We present our results on Uniform Price Auctions, one of the standard sealed-bid multi-unit auction formats, for selling multiple identical units of a single good to multi-demand bidders. Contrary to the truthful and economically efficient…
We study the computational complexity of computing Bayes-Nash equilibria in first-price auctions with discrete value distributions and discrete bidding space, under general subjective beliefs. It is known that such auctions do not always…
The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…
We initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…
Equilibria in auctions can be very difficult to analyze, beyond the symmetric environments where revenue equivalence renders the analysis straightforward. This paper takes a robust approach to evaluating the equilibria of auctions. Rather…
We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with continuous value distributions and discrete bidding space. We prove that when bidders have independent subjective prior beliefs about the…
In practice, most auction mechanisms are not strategy-proof, so equilibrium analysis is required to predict bidding behavior. In many auctions, though, an exact equilibrium is not known and one would like to understand whether -- manually…
Given a sample of bids from independent auctions, this paper examines the question of inference on auction fundamentals (e.g. valuation distributions, welfare measures) under weak assumptions on information structure. The question is…
Classic results show that even an arbitrarily small correlation across bidders' information can enable full surplus extraction in auctions and related mechanism design settings. Motivated by this fragility, we study the information…
We study the plausibility of sub-optimal Nash equilibria of the direct revelation mechanism associated with a strategy-proof social choice function. By using the recently introduced empirical equilibrium analysis (Velez and Brown, 2019,…
Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…
In a two-round auction, a subset of bidders is selected (probabilistically), according to their bids in the first round, for the second round, where they can increase their bids. We formalize the two-round auction model, restricting the…
In this paper, we revisit the common claim that double auctions necessarily generate competitive equilibria. We begin by observing that competitive equilibrium has some counterintuitive implications: specifically, it predicts that monotone…
This paper examines how risk and budget limits on investment mandates affect the bidding strategy in a uniform-price auction for issuing corporate bonds. I prove the existence of symmetric Bayesian Nash equilibrium and explore how the risk…
Our paper concerns the computation of Nash equilibria of first-price auctions with correlated values. While there exist several equilibrium computation methods for auctions with independent values, the correlation of the bidders' values…
In this paper, we design and implement an experiment aimed at testing the level-k model of auctions. We begin by asking which (simple) environments can best disentangle the level-k model from its leading rival, Bayes-Nash equilibrium. We…
We study combinatorial auctions where each item is sold separately but simultaneously via a second price auction. We ask whether it is possible to efficiently compute in this game a pure Nash equilibrium with social welfare close to the…
We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auctions in three different environments: combinatorial, multi-unit and single-item auctions. First, we consider item-bidding combinatorial…