481 search results - page 2 / 97 » Martin's game: a lower bound for the number of sets |
LOGCOM
2002
13 years 5 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
DCG
2006
13 years 5 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
WINE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
DM
2008
13 years 5 months ago
2008
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
DCG
1999
13 years 5 months ago
1999
This paper presents a new lower bound of 2:414d= p d on the maximal number of Nash equilibria in d d bimatrix games, a central concept in game theory. The proof uses an equivalent ...