Sciweavers

40 search results - page 5 / 8
» Concurrent Games and Full Completeness
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
FOSSACS
2007
Springer
14 years 2 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...
FSTTCS
2010
Springer
13 years 6 months ago
ATL with Strategy Contexts: Expressiveness and Model Checking
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
Arnaud Da Costa Lopes, François Laroussinie...
APAL
2007
99views more  APAL 2007»
13 years 8 months ago
A categorical semantics for polarized MALL
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurent...
Masahiro Hamano, Philip J. Scott
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan