deletions | additions       diff --git a/In_this_paper_we.tex b/In_this_paper_we.tex  index 0e3cfb5..08a9933 100644  --- a/In_this_paper_we.tex  +++ b/In_this_paper_we.tex 
...
In this paper we map the MAPF problem to a {\em combinatorial auction} problem. Combinatorial auctions are auctions in which participants can place bids on ``bundles'' of items rather than individual items.   In combinatorial auction the auctioneer puts up for sale a set of items $M$ and agents bid on bundles of items $B \subset M$. The auction determines a final allocation of bundles based on agents' bids, such that no item is sold to more than one agent.  sdfdsf