Sciweavers

309 search results - page 42 / 62
» Path coalitional games
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
A new proof of Nash's Theorem via exchangeable equilibria
We give a novel proof of the existence of Nash equilibria in all finite games without using fixed point theorems or path following arguments. Our approach relies on a new notion i...
Noah D. Stein, Pablo A. Parrilo, Asuman E. Ozdagla...
IAT
2007
IEEE
14 years 2 months ago
Information Sharing in an Agent Organized Network
Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. N...
Levi Barton, Vicki H. Allan
AIIDE
2006
13 years 9 months ago
Mixing Story and Simulation in Interactive Narrative
Simulation is a common feature in computer entertainment. However, in computer games simulation and story are often kept distinct by interleaving interactive play and cut scenes. ...
Mark O. Riedl, Andrew Stern, Don M. Dini
TASLP
2008
96views more  TASLP 2008»
13 years 7 months ago
Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
Fabio Antonacci, M. Foco, Augusto Sarti, Stefano T...