Sciweavers

15 search results - page 1 / 3
» Computing Best-Response Strategies in Infinite Games of Inco...
Sort
View
UAI
2004
13 years 5 months ago
Computing Best-Response Strategies in Infinite Games of Incomplete Information
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
Daniel M. Reeves, Michael P. Wellman
ATAL
2008
Springer
13 years 6 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman
WCNC
2010
IEEE
13 years 8 months ago
Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
Kun Zhu, Dusit Niyato, Ping Wang
GAMESEC
2010
128views Game Theory» more  GAMESEC 2010»
13 years 2 months ago
Tracking Games in Mobile Networks
Abstract. Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must ...
Mathias Humbert, Mohammad Hossein Manshaei, Julien...
ATAL
2011
Springer
12 years 4 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm