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 introduces significant complications that render existing methods unsatisfactory in practice. Our contribution is a step towards filling this gap: inspired by the seminal fictitious play process of Brown and Robinson, we present a learning heuristic-that we call fictitious bidding (FB)-for estimating Bayes-Nash equilibria of first-price auctions with correlated values, and we assess the performance of this heuristic on several relevant examples
In this lecture we pass from second-price to first-price auctions — auctions where you pay your bid....
We analyze a repeated first-price auction in which the types of the players are determined before th...
We present a new algorithm for computing pure-strategy ε-Bayes-Nash equilibria (ε-BNEs) in combinato...
We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with...
This paper presents a methodology for designing trading agents for complex games. We compute, for th...
Auctions define games of incomplete information for which it is often too hard to compute the exact...
We investigate how automated traders strategically select marketplaces and submit offers across mult...
This paper proposes a structural nonequilibrium model of initial responses to incomplete-information...
This paper proposes a structural nonequilibrium model of initial responses to incomplete-information...
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous ...
AbstractWe extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-Na...
Bayes-Nash equilibria (BNE) have been derived analytically only for the simplest auction settings (K...
This paper proposes a structural non-equilibrium model of initial responses to incomplete-informatio...
This paper considers bidding automata programmed by experienced subjects in sequential first price s...
Modern techniques for representing games and computing their Nash equilibria are approaching the poi...
In this lecture we pass from second-price to first-price auctions — auctions where you pay your bid....
We analyze a repeated first-price auction in which the types of the players are determined before th...
We present a new algorithm for computing pure-strategy ε-Bayes-Nash equilibria (ε-BNEs) in combinato...
We consider the problem of computing a (pure) Bayes-Nash equilibrium in the first-price auction with...
This paper presents a methodology for designing trading agents for complex games. We compute, for th...
Auctions define games of incomplete information for which it is often too hard to compute the exact...
We investigate how automated traders strategically select marketplaces and submit offers across mult...
This paper proposes a structural nonequilibrium model of initial responses to incomplete-information...
This paper proposes a structural nonequilibrium model of initial responses to incomplete-information...
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous ...
AbstractWe extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-Na...
Bayes-Nash equilibria (BNE) have been derived analytically only for the simplest auction settings (K...
This paper proposes a structural non-equilibrium model of initial responses to incomplete-informatio...
This paper considers bidding automata programmed by experienced subjects in sequential first price s...
Modern techniques for representing games and computing their Nash equilibria are approaching the poi...
In this lecture we pass from second-price to first-price auctions — auctions where you pay your bid....
We analyze a repeated first-price auction in which the types of the players are determined before th...
We present a new algorithm for computing pure-strategy ε-Bayes-Nash equilibria (ε-BNEs) in combinato...