Sciweavers

330 search results - page 30 / 66
» Open Problems in Logic and Games
Sort
View
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 9 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 6 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
HYBRID
2000
Springer
13 years 11 months ago
Decidable Controller Synthesis for Classes of Linear Systems
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...
Omid Shakernia, Shankar Sastry, George J. Pappas
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 6 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 8 months ago
The finite model theory toolbox of a database theoretician
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
Leonid Libkin