Parameter-free sampled fictitious play for solving deterministic dynamic programming problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A note on two problems in connexion with graphs
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
Approximate Dynamic Programming
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
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
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
Faster algorithms for the shortest path problem
Deterministic Minimal Time Vessel Routing
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
A Fictitious Play Approach to Large-Scale Optimization
Neuro-Dynamic Programming: An Overview and Recent Results
Sampled fictitious play for approximate dynamic programming
An Appraisal of Some Shortest-Path Algorithms
Approximate dynamic programming with a fuzzy parameterization

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)