Generalised Fictitious Play for a Continuum of Anonymous Players


Rabinovich, Zinovi, Gerding, Enrico, Polukarov, Maria and Jennings, Nicholas R. (2009) Generalised Fictitious Play for a Continuum of Anonymous Players At Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), United States. , pp. 245-250.

Download

[img] PDF Rabinovich.pdf - Author's Original
Download (107kB)

Description/Abstract

Recently, efficient approximation algorithms for finding Nash equilibria have been developed for the interesting class of {\it anonymous games}, where a player's utility does not depend on the identity of its opponents. In this paper, we tackle the problem of computing equilibria in such games with {\it continuous player types}, extending the framework to encompass settings with imperfect information. In particular, given the existence result for pure Bayes-Nash equilibiria in these games, we generalise the {\it fictitious play algorithm} by developing a novel procedure for finding a best response strategy, which is specifically designed to deal with continuous and, therefore, infinite type spaces. We then combine the best response computation with the general fictitious play structure to obtain an equilibrium. To illustrate the power of this approach, we apply our algorithm to the domain of simultaneous auctions with continuous private values and discrete bids, in which the algorithm shows quick convergence.

Item Type: Conference or Workshop Item (Paper)
Additional Information: to appear
Venue - Dates: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), United States, 2009-07-01
Organisations: Agents, Interactions & Complexity
ePrint ID: 267271
Date :
Date Event
July 2009Published
Date Deposited: 10 Apr 2009 12:31
Last Modified: 17 Apr 2017 18:50
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/267271

Actions (login required)

View Item View Item