Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
From MaRDI portal
(Redirected from Publication:289136)
Recommendations
Cites work
- scientific article; zbMATH DE number 1346778 (Why is no real title available?)
- scientific article; zbMATH DE number 1983335 (Why is no real title available?)
- scientific article; zbMATH DE number 1424303 (Why is no real title available?)
- scientific article; zbMATH DE number 3069635 (Why is no real title available?)
- A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
- A Fictitious Play Approach to Large-Scale Optimization
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking
- A note on two problems in connexion with graphs
- An Appraisal of Some Shortest-Path Algorithms
- An iterative method of solving a game
- Approximate Dynamic Programming
- Approximate dynamic programming with a fuzzy parameterization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Deterministic Minimal Time Vessel Routing
- Faster algorithms for the shortest path problem
- Fermat's principle, Huygens' principle, Hamilton's optics and sailing strategy
- Fictitious play property for games with identical interests
- Interaction of finite-amplitude waves with vertically sheared current fields
- Minimal Time Vessel Routing in a Time-Dependent Environment
- Network flows. Theory, algorithms, and applications.
- Neuro-Dynamic Programming: An Overview and Recent Results
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
- Optimal adaptive control and differential games by reinforcement learning principles
- Optimal path finding in direction, location, and time dependent environments
- Payoff-based dynamics for multiplayer weakly acyclic games
- Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
- Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Sampled fictitious play for approximate dynamic programming
- Shortest paths of bounded curvature in the plane
- Stochastic optimization and yacht racing
- Yacht velocity prediction using mathematical programming
This page was built for publication: Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289136)