Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types
作者:
摘要
We extend the well-known fictitious play (FP) algorithm to compute pure-strategy Bayesian-Nash equilibria in private-value games of incomplete information with finite actions and continuous types (G-FACTs). We prove that, if the frequency distribution of actions (fictitious play beliefs) converges, then there exists a pure-strategy equilibrium strategy that is consistent with it. We furthermore develop an algorithm to convert the converged distribution of actions into an equilibrium strategy for a wide class of games where utility functions are linear in type. This algorithm can also be used to compute pure ϵ-Nash equilibria when distributions are not fully converged. We then apply our algorithm to find equilibria in an important and previously unsolved game: simultaneous sealed-bid, second-price auctions where various types of items (e.g., substitutes or complements) are sold. Finally, we provide an analytical characterisation of equilibria in games with linear utilities. Specifically, we show how equilibria can be found by solving a system of polynomial equations. For a special case of simultaneous auctions, we also solve the equations confirming the results obtained numerically.
论文关键词:Algorithmic game theory,Bayes–Nash equilibrium,Epsilon-Nash equilibrium,Fictitious play,Simultaneous auctions
论文评审过程:Received 31 May 2011, Revised 17 August 2012, Accepted 15 September 2012, Available online 18 September 2012.
论文官网地址:https://doi.org/10.1016/j.artint.2012.09.007