Potential game-theoretic analysis of a market-based decentralized task allocation algorithm

Abstract

This paper presents a potential game-theoretic interpretation and analysis of a decentralized task allocation algorithm, consensus-based bundled algorithm, which was developed by the authors’ prior work. It is, in particular, proved that the consensus-based bundle algorithm converges to a pure strategy Nash equilibrium of some distributed welfare game, and the price of anarchy and the price of stability of this equilibrium are 1/2 and 1, respectively.