Sciweavers

1410 search results - page 75 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
GLOBECOM
2007
IEEE
15 years 5 months ago
A Congestion-Only Charging Mechanism for Multiplayer Gaming in Differentiated Services Networks
— In future networks based on the Differentiated Services (DiffServ) architecture, users may be provided with the opportunity to choose their Assured Forwarding (AF) class. Users...
Brian Carrig, David Denieffe, John Murphy
INFOCOM
2012
IEEE
13 years 1 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 6 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica
ATAL
2007
Springer
15 years 5 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...