374 search results - page 32 / 75 » Generalized Nash equilibrium problems |
103
click to vote
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
We present the agent programming language POGTGolog, which combines explicit agent programming in Golog with game-theoretic multi-agent planning in a special kind of partially obs...
97
Voted
CORR
2010
Springer
15 years 3 days ago
2010
Springer
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
125
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
94
Voted
WINE
2009
Springer
15 years 7 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
87
Voted
AAMAS
2007
Springer
15 years 20 days ago
2007
Springer
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...