Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
From MaRDI portal
Publication:289136
DOI10.1007/s10957-015-0798-5zbMath1342.90218OpenAlexW2164923190MaRDI QIDQ289136
Irina S. Dolinskaya, Robert L. Smith, Esra Şişikoğlu Sir, Marina A. Epelman
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0798-5
Applications of game theory (91A80) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Sampled fictitious play for approximate dynamic programming
- Approximate dynamic programming with a fuzzy parameterization
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- Yacht velocity prediction using mathematical programming
- Shortest paths of bounded curvature in the plane
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fictitious play property for games with identical interests
- An iterative method of solving a game
- Minimal Time Vessel Routing in a Time-Dependent Environment
- Optimal path finding in direction, location, and time dependent environments
- Interaction of finite-amplitude waves with vertically sheared current fields
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
- Faster algorithms for the shortest path problem
- Deterministic Minimal Time Vessel Routing
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
- Fermat's principle, Huygens' principle, Hamilton's optics and sailing strategy
- Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
- Optimal Adaptive Control and Differential Games by Reinforcement Learning Principles
- Approximate Dynamic Programming
- A Fictitious Play Approach to Large-Scale Optimization
- Neuro-Dynamic Programming: An Overview and Recent Results
- An Appraisal of Some Shortest-Path Algorithms
