首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Fictitious play in ‘one-against-all’ multi-player games
Authors:Aner Sela
Institution:(1) Department of Economics, Ben-Gurion University of the Negev, P.O.B. 653, Beer-Sheva 84105, ISRAEL (e-mail: anersela@bgumail.bgu.ac.il) , IL
Abstract:Summary. A compound game is an (n + 1) player game based on n two-person subgames. In each of these subgames player 0 plays against one of the other players. Player 0 is regulated, so that he must choose the same strategy in all n subgames. We show that every fictitious play process approaches the set of equilibria in compound games for which all subgames are either zero-sum games, potential games, or games. Received: July 18, 1997; revised version: December 4, 1998
Keywords:and Phrases: Learning  Fictitious play  Zero-sum games  Potential games  
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号