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.
CITATION STYLE
Choi, H. L., Kim, K. S., Johnson, L. B., & How, J. P. (2016). Potential game-theoretic analysis of a market-based decentralized task allocation algorithm. In Springer Tracts in Advanced Robotics (Vol. 112, pp. 207–220). Springer Verlag. https://doi.org/10.1007/978-4-431-55879-8_15
Mendeley helps you to discover research relevant for your work.