Sciweavers

5 search results - page 1 / 1
» Local Search Methods for Finding a Nash Equilibrium in Two-P...
Sort
View
IAT
2010
IEEE
13 years 2 months ago
Local Search Methods for Finding a Nash Equilibrium in Two-Player Games
Sofia Ceppi, Nicola Gatti, Giorgio Patrini, Marco ...
AAAI
2004
13 years 6 months ago
Simple Search Methods for Finding a Nash Equilibrium
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...
Ryan Porter, Eugene Nudelman, Yoav Shoham
JSAC
2008
140views more  JSAC 2008»
13 years 4 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
VTC
2010
IEEE
163views Communications» more  VTC 2010»
13 years 3 months ago
Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Ha...
UAI
2000
13 years 6 months ago
Learning to Cooperate via Policy Search
Cooperative games are those in which both agents share the same payoff structure. Valuebased reinforcement-learning algorithms, such as variants of Q-learning, have been applied t...
Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Les...