Ofra Amir edited In_this_paper_we.tex  over 9 years ago

Commit id: 1ec5a8858d7a176d273aec02f6049d27783763bd

deletions | additions      

       

In this paper we map the  MAPF problem  to a  {\em combinatorial auctions}. 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