Sciweavers

533 search results - page 58 / 107
» Playing games with approximation algorithms
Sort
View
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
14 years 1 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
NETGAMES
2006
ACM
14 years 1 months ago
Post-game estimation of game client RTT and hop count distributions
In first person shooter (FPS) games the round trip time (RTT) (delay, or ‘lag’) between a client and server is an important criterion for players when deciding which server to ...
Grenville J. Armitage, Carl Javier, Sebastian Zand...
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 7 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Manipulation in Games
This paper studies to which extent the social welfare of a game can be influenced by an interested third party within economic reason, i.e., by taking the implementation cost into...
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schm...
AAIM
2005
Springer
75views Algorithms» more  AAIM 2005»
14 years 1 months ago
Mechanism Design for Set Cover Games When Elements Are Agents
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
Zheng Sun, Xiang-Yang Li, Weizhao Wang, Xiaowen Ch...