30 search results - page 1 / 6 » Choosing Samples to Compute Heuristic-Strategy Nash Equilibr... |
AMEC
2003
Springer
13 years 10 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
AAAI
2004
13 years 6 months ago
2004
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
— We consider the issue of fair share of the spectrum opportunity for the case of spectrum-overlay cognitive radio networks. Owing to the decentralized nature of the network, we ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
JAIR
2011
12 years 7 months ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...