Sciweavers

20 search results - page 2 / 4
» The Complexity of Semilinear Problems in Succinct Representa...
Sort
View
CACM
2006
95views more  CACM 2006»
13 years 6 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
STACS
2007
Springer
14 years 4 days ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 6 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
SIGECOM
2003
ACM
134views ECommerce» more  SIGECOM 2003»
13 years 11 months ago
Correlated equilibria in graphical games
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
Sham Kakade, Michael J. Kearns, John Langford, Lui...
ATAL
2008
Springer
13 years 8 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...