230 search results - page 5 / 46 » Computing Optimal Strategies to Commit to in Stochastic Game... |
AAAI
2008
13 years 10 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
Primary user emulation attack in multichannel cognitive radio systems is discussed. An attacker is assumed to be able to send primary-user-like signals during spectrum sensing peri...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
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 ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....