1683 search results - page 46 / 337 » Game Theory Basics |
159
click to vote
SAGT
2010
Springer
15 years 4 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...
185
click to vote
ICALT
2007
IEEE
16 years 15 days 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...
151
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In the context of pre-Bayesian games we analyze resource selection systems with unknown number of players. We prove the existence and uniqueness of a symmetric safety-level equili...
146
click to vote
DAM
2008
15 years 6 months ago
2008
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously is an extended Boolean function f of the size of th...
182
click to vote
ISPDC
2007
IEEE
16 years 14 days ago
2007
IEEE
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...