guni edited sectionReducing_Opti.tex  over 9 years ago

Commit id: fddda57280d37eea53407c5e61aa8f91fbf5f8cb

deletions | additions      

       

\section{ReducingOptimal  MAPF to Combinatorial Auctions} The items in the corresponding combinatorial auction are pairs of time and location.   Bundles are paths. Utility is UpperBound*k minus path cost..