Auction-Based Multi-Robot Routing
2005
Citations Over TimeTop 1% of 2005 papers
Michail G. Lagoudakis, Evangelos Markakis, David Kempe, Pınar Keskinocak, Anton J. Kleywegt, Sven Koenig, Craig A. Tovey, Adam Meyerson, Sonal Jain
Abstract
Experimental research has shown great potential, but has not been complemented yet by theoretical analysis. In this paper we contribute a theoretical analysis of the performance of auction methods for multi-robot routing. We suggest a generic framework for auction-based multi-robot routing and analyze a variety of bidding rules for different team objectives. This is the first time that auction methods are shown to offer theoretical guarantees for such a variety of bidding rules and team objectives.
Related Papers
- → Combinatorial Auction Design(2003)284 cited
- → Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction(2012)31 cited
- → Privacy-Preserving Strategyproof Auction Mechanisms for Resource Allocation in Wireless Communications(2016)6 cited
- Development and evaluation of a secure, privacy preserving combinatorial auction(2011)
- Are Dynamic Vickrey Auctions Practical?: Properties of the Combinatorial Clock Auction(2014)