234 search results - page 22 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
IM
2008
14 years 9 months ago
2008
Abstract. Congestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not hav...
109
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
NETCOOP
2007
Springer
15 years 3 months ago
2007
Springer
— We present both a game theoretic and a distributed algorithmic approach for the transit price negotiation problem in the interdomain routing framework. We analyze the behavior ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— We formulate a coverage optimization problem for mobile visual sensor networks as a repeated multi-player game. Each visual sensor tries to optimize its own coverage while mini...