Sciweavers

4435 search results - page 16 / 887
» Algorithms, games, and the internet
Sort
View
FORMATS
2007
Springer
14 years 1 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 8 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
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
FORMATS
2009
Springer
14 years 1 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...