Sciweavers

179 search results - page 15 / 36
» On Learning Algorithms for Nash Equilibria
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
15 years 6 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
UAI
2000
15 years 1 months ago
Fast Planning in Stochastic Games
Stochastic games generalize Markov decision processes MDPs to a multiagent setting by allowing the state transitions to depend jointly on all player actions, and having rewards de...
Michael J. Kearns, Yishay Mansour, Satinder P. Sin...
FUIN
2008
128views more  FUIN 2008»
14 years 11 months ago
Impact of Asynchrony on the Behavior of Rational Selfish Agents
The behavior of rational selfish agents has been classically studied in the framework of strategic games in which each player has a set of possible actions, players choose actions ...
David Ilcinkas, Andrzej Pelc
ICALP
2007
Springer
15 years 3 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis