MIT CogNet, The Brain Sciences ConnectionFrom the MIT Press, Link to Online Catalog
SPARC Communities
Subscriber : Stanford University Libraries » LOG IN

space

Powered By Google 
Advanced Search

 

An efficient, exact algorithm for solving tree-structured graphical games

 Michael Littman, Michael Kearns and Satinder Singh
  
 

Abstract:

We describe a new algorithm for computing a Nash equilibrium in graphical games , a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the first to compute equilibria both efficiently and exactly for a non-trivial class of graphical games.

 
 


© 2010 The MIT Press
MIT Logo