Name
Abstract | ||
|---|---|---|
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39866-0_38 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
nash equilibria,polynomial time,computational complexity,game theory,reactive system,automata theory,it strategy,complexity class,model checking | Discrete mathematics,Unimodality,Model checking,Iterative method,Upper and lower bounds,Computer science,Algorithm,Theoretical computer science,Tree automaton,Stochastic game | Conference |
Volume | ISSN | Citations |
2890 | 0302-9743 | 11 |
PageRank | References | Authors |
0.91 | 20 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henrik Björklund | 1 | 311 | 20.41 |
| Sven Sandberg | 2 | 140 | 9.64 |
| Sergei G. Vorobyov | 3 | 92 | 7.40 |