论文信息 - Reverse Combinatorial Auctions for Resource Allocation in the Rescue Scenario

Reverse Combinatorial Auctions for Resource Allocation in the Rescue Scenario

In a disaster environment no single agent knows the disaster situation completely. So, rescue agents share their information in order to identify rescue tasks that are then allocated. In this paper we model the allocation problem as a reverse combinatorial auction and we apply some existing algorithms to solve it. Our results have been compared with the RoboCup classification of 2005.

Silvia Suárez | Beatriz López

[1] Silvia Suáreza,et al. Improving Rescue Operations in Disasters : Approaches about Task Allocation and rescheduling , 2005 .

[2] Maria L. Gini,et al. Solving combinatorial auctions with temporal constraints in economic agents , 2002 .

[3] Maria L. Gini,et al. Harnessing the search for rational bid schedules with stochastic search and domain-specific heuristics , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[4] David Levine,et al. CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..

[5] Maria L. Gini,et al. Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints , 2002, AMEC.