12 search results - page 2 / 3 » Nash Equilibrium and Subgame Perfection in Observable Queues |
AAAI
2006
13 years 7 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
AAAI
2006
13 years 7 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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as ...
PRIMA
2007
Springer
13 years 11 months ago
2007
Springer
Multiagent Partially Observable Markov Decision Processes are a popular model of multiagent systems with uncertainty. Since the computational cost for finding an optimal joint pol...
NIPS
2003
13 years 7 months ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...