34 search results - page 6 / 7 » Finding Equilibria in Games of No Chance |
SIROCCO
2010
13 years 7 months ago
2010
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
AUTOMATICA
2010
13 years 4 months ago
2010
This paper analyzes competition between mutual funds in a multiple funds version of the model of Hugonnier and Kaniel [17]. We characterize the set of equilibria for this portfoli...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a v...