2 citations · 4 across the 5 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022★ 1 cited
New Auction Algorithms for Path Planning, Network Transport, and Reinforcement Learning
Dimitri Bertsekas
We consider some classical optimization problems in path planning and network transport, and we introduce new auction-based algorithms for their optimal and suboptimal solution. Th…
math.OC2016
Regular Policies in Abstract Dynamic Programming
Dimitri P. Bertsekas
We consider challenging dynamic programming models where the associated Bellman equation, and the value and policy iteration algorithms commonly exhibit complex and even pathologic…