Sciweavers

5995 search results - page 278 / 1199
» Algorithmic Game Theory
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
ML
2006
ACM
15 years 6 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
GLOBECOM
2007
IEEE
16 years 1 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 9 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»
16 years 1 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