SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4962 LNCS, Issue , 2008, Pages 5-19

Simple stochastic games with few random vertices are easy to solve

(2) Gimbert, Hugo a Horn, Florian b

a UNIVERSITÉ BORDEAUX 1 (France)

b UNIVERSITÉ PARIS DIDEROT (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; FOUNDATIONS; STOCHASTIC PROGRAMMING;

COMPUTATIONAL STRUCTURES; EUROPEAN; EXHAUSTIVE SEARCH; INTERNATIONAL (CO); NEW ALGORITHM; OPTIMAL STRATEGIES; RUNNING TIME; SIMPLE STOCHASTIC GAMES; SOFTWARE SCIENCE;

GAME THEORY;

EID: 47249144816 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-78499-9_2 Document Type: Conference Paper

Times cited : (31)

References (11)

1
- 0026820657
- The complexity of stochastic games
- Condon, A.: The complexity of stochastic games. Information and Computation 96, 203-224 (1992)
- (1992) Information and Computation , vol.96 , pp. 203-224
- Condon, A.¹

2
- 0012348982
- On algorithms for simple stochastic games
- Advances in computational complexity theory
- Condon, A.: On algorithms for simple stochastic games. In: Advances in computational complexity theory. DIMACS series in discrete mathematics and theoretical computer science, vol. 13, pp. 51-73 (1993)
- (1993) DIMACS series in discrete mathematics and theoretical computer science , vol.13 , pp. 51-73
- Condon, A.¹

3
- 0003421685
- Academic Press, London
- Derman, C.: Finite State Markov Decision Processes. Academic Press, London (1972)
- (1972) Finite State Markov Decision Processes
- Derman, C.¹

4
- 0001380055
- Exact solution of linear equations using p-adic expansions
- Dixon, J.D.: Exact solution of linear equations using p-adic expansions. Numerische Mathematik 40, 137-141 (1982)
- (1982) Numerische Mathematik , vol.40 , pp. 137-141
- Dixon, J.D.¹

5
- 45849111687
- Gimbert, H., Horn, F.: Solving simple stochastic games with few random vertices, http://hal.archives-ouvertes.fr/hal-00195914/fr/
- Solving simple stochastic games with few random vertices
- Gimbert, H.¹ Horn, F.²

6
- 36549026400
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Halman, N.: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems. Algorithmica 49, 37-50 (2007)
- (2007) Algorithmica , vol.49 , pp. 37-50
- Halman, N.¹

7
- 0000564361
- A polynomial time algorithm for linear programming
- Kachiyan, L.G.: A polynomial time algorithm for linear programming. Soviet Math. Dokl. 20, 191-194 (1979)
- (1979) Soviet Math. Dokl , vol.20 , pp. 191-194
- Kachiyan, L.G.¹

8
- 0013455073
- A subexponential randomized algorithm for the simple stochastic game problem
- Ludwig, W.: A subexponential randomized algorithm for the simple stochastic game problem. Information and Computation 117, 151-155 (1995)
- (1995) Information and Computation , vol.117 , pp. 151-155
- Ludwig, W.¹

9
- 0023862337
- A polynomial-time algorithm, based on newton's method, for linear programming
- Renegar, J.: A polynomial-time algorithm, based on newton's method, for linear programming. Mathematical Programming 40, 59-93 (1988)
- (1988) Mathematical Programming , vol.40 , pp. 59-93
- Renegar, J.¹

10
- 0000392613
- Stochastic games
- Shapley, L.S.: Stochastic games. In: Proceedings of the National Academy of Science USA, vol. 39, pp. 1095-1100 (1953)
- (1953) Proceedings of the National Academy of Science USA , vol.39 , pp. 1095-1100
- Shapley, L.S.¹

11
- 13544251463
- Somla, R.: New algorithms for solving simple stochastic games. Electr. Notes Theor. Comput. Sci. 119(1), 51-65 (2005)
- Somla, R.: New algorithms for solving simple stochastic games. Electr. Notes Theor. Comput. Sci. 119(1), 51-65 (2005)

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.