deletions | additions       diff --git a/sectioniBundle_for_M.tex b/sectioniBundle_for_M.tex  index 7fb6e30..c48f07c 100644  --- a/sectioniBundle_for_M.tex  +++ b/sectioniBundle_for_M.tex 
...
\section{iBundle for MAPF}  For %For  both optimal and self-interested MAPF, there are many corresponding auction algorithms. The reduction above for MAPF has several properties.... While the reduction from MAPF to CA allows the use of any CA mechanism for solving MAPF, the choice of mechanism is important as different auction mechanisms have different properties and provide different guarantees (e.g., efficiency, strategyproofness). MAPF problems have several charactaristics that should be considered when choosing an auction mechanism:  \begin{itemize}  \item Large number of items: any pair of location and time is an item to be considered by the agents.   \item Large number of bundles: as a result of the large number of items, there is an even larger number of possible bundles agents can bid on.  \item Potentially large bundle sizes: agents might bid on a large set of items if their path to the goal is long.  \end{itemize}