Sciweavers

406 search results - page 12 / 82
» Games with Opacity Condition
Sort
View
ATAL
2006
Springer
13 years 11 months ago
A technique for reducing normal-form games to compute a Nash equilibrium
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
Vincent Conitzer, Tuomas Sandholm
MOBIHOC
2012
ACM
11 years 10 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
IWEC
2007
13 years 9 months ago
Game Design Guided by Visual Attention
Abstract. Visual attention plays a critical role in game playing. A better understanding of the allocation of visual attention can benefit the design of game scenarios. In this pa...
Li Jie, James J. Clark
SIAMCO
2002
89views more  SIAMCO 2002»
13 years 7 months ago
Convexity in Zero-Sum Differential Games
A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Rafal Goebel