Task selection strategies of self-interested robots in skill games Online publication date: Sat, 16-Jun-2018
by Hao Wang; Ming-Lan Fu; Bao-Fu Fang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 14, No. 3, 2018
Abstract: This paper focuses on task allocation for multiple self-interested robots coalition skill games. When the self-interested robots select tasks, it is difficult for them to maximise both their individual revenues and the system revenue simultaneously. But through the reasonable distribution of the tasks' utilities, the two matrices can be kept consistent to some extent. Based on this idea, an algorithm is proposed to allocate tasks to self-interested robots which can be in conservative state or radical state. The conservative task selection strategies ensure that the game will converge to Nash equilibrium. The radical task selection strategies help the algorithm jump out the Nash equilibrium. Tasks' utilities are distributed according to the robots' powers in the game. Meanwhile, the algorithm endows each robot with a numerical value, called patience, to allow the robots to transform between these two states. Finally, the simulation results verified the effectiveness of the algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook