1616 search results - page 36 / 324 » Robust game theory |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
SIGECOM
2010
ACM
14 years 14 days ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
ICALT
2007
IEEE
14 years 2 months ago
2007
IEEE
How can game designers realize the balance of “educational function” and “entertainment” in a Computer-based Educational Game (CEG)? The concept of IMS learning design (LD...