Sciweavers

3780 search results - page 11 / 756
» Algorithms for Game Metrics
Sort
View
FORMATS
2007
Springer
13 years 11 months ago
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
Franck Cassez
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
13 years 5 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
FORMATS
2009
Springer
13 years 11 months ago
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
APPROX
2009
Springer
108views Algorithms» more  APPROX 2009»
14 years 2 months ago
Strong Parallel Repetition Theorem for Free Projection Games
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen ...
STOC
2001
ACM
114views Algorithms» more  STOC 2001»
14 years 7 months ago
Testing metric properties
Michal Parnas, Dana Ron