294 search results - page 19 / 59 » The complexity of computing a Nash equilibrium |
JUCS
2010
14 years 4 months ago
2010
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
WCNC
2010
IEEE
15 years 1 months ago
2010
IEEE
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
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...
104
click to vote
AAAI
2006
14 years 11 months ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study convergence of ε-Nash dynamics in congestion games when delay functions of all resources are similar. Delay functions are said to be similar if their values are within a...