Deciding whether a pure Bayes-Nash equilibrium exists in a discrete first-price auction with correlated values is NP-hard, while approximate monotone equilibria for affiliated values admit polynomial-time algorithms.
Single crossing properties and the existence of pure strategy equilibria in games of incomplete information
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Equilibrium Computation in First-Price Auctions with Correlated Priors
Deciding whether a pure Bayes-Nash equilibrium exists in a discrete first-price auction with correlated values is NP-hard, while approximate monotone equilibria for affiliated values admit polynomial-time algorithms.