Sciweavers

1599 search results - page 145 / 320
» Algorithms for Parity Games
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
CORR
2008
Springer
211views Education» more  CORR 2008»
15 years 6 months ago
Competitive Design of Multiuser MIMO Systems based on Game Theory: A Unified View
Abstract--This paper considers the noncooperative maximization of mutual information in the Gaussian interference channel in a fully distributed fashion via game theory. This probl...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
ATAL
2009
Springer
16 years 1 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
NETGAMES
2006
ACM
16 years 15 days ago
A relative delay minimization scheme for multiplayer gaming in differentiated services networks
Multiplayer gaming over the Internet continues to grow in popularity, despite a lack of Quality of Service (QoS) mechanisms. Future QoS-aware networks such as those based on the D...
Brian Carrig, David Denieffe, John Murphy
EWCBR
2008
Springer
15 years 8 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...