The following pages link to Games against nature (Q1069296):
Displayed 27 items.
- Randomization for robot tasks: using dynamic programming in the space of knowledge states (Q686748) (← links)
- Shortest paths without a map (Q809612) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability (Q997058) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- The complexity of stochastic games (Q1187025) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
- Interactive and probabilistic proof-checking (Q1577488) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H) (Q2638964) (← links)
- (Q2741527) (← links)
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines (Q3415915) (← links)
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability (Q3534675) (← links)
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596) (← links)
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic (Q5387634) (← links)
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines (Q5488538) (← links)
- Dot operators (Q5958134) (← links)