Game theory-based negotiation for multiple robots task allocation

Robotica ◽  
2013 ◽  
Vol 31 (6) ◽  
pp. 923-934 ◽  
Author(s):  
Rongxin Cui ◽  
Ji Guo ◽  
Bo Gao
Keyword(s):  
Game Theory ◽  
Task Allocation ◽  
Optimal Solution ◽  
Multiple Robots ◽  
Negotiation Strategy ◽  
Contract Net ◽  
Initial Task ◽  
The Game Theory ◽  
Task Reallocation ◽  
Negotiation Mechanism

SUMMARYThis paper investigates task allocation for multiple robots by applying the game theory-based negotiation approach. Based on the initial task allocation using a contract net-based approach, a new method to select the negotiation robots and construct the negotiation set is proposed by employing the utility functions. A negotiation mechanism suitable for the decentralized task allocation is also presented. Then, a game theory-based negotiation strategy is proposed to achieve the Pareto-optimal solution for the task reallocation. Extensive simulation results are provided to show that the task allocation solutions after the negotiation are better than the initial contract net-based allocation. In addition, experimental results are further presented to show the effectiveness of the approach presented.

Cloud service negotiation framework for real-time E-commerce application using game theory decision system

2021 ◽  
pp. 1-12
Author(s):  
Rajkumar Rajavel ◽  
Sathish Kumar Ravichandran ◽  
Partheeban Nagappan ◽  
Kanagachidambaresan Ramasubramanian Gobichettipalayam
Keyword(s):  
Game Theory ◽  
Service Level Agreement ◽  
Optimal Solution ◽  
Cloud Service ◽  
Service Level ◽  
Third Party ◽  
Service Access ◽  
Decision System ◽  
Increasing Demand ◽  
Negotiation Mechanism

A major demanding issue is developing a Service Level Agreement (SLA) based negotiation framework in the cloud. To provide personalized service access to consumers, a novel Automated Dynamic SLA Negotiation Framework (ADSLANF) is proposed using a dynamic SLA concept to negotiate on service terms and conditions. The existing frameworks exploit a direct negotiation mechanism where the provider and consumer can directly talk to each other, which may not be applicable in the future due to increasing demand on broker-based models. The proposed ADSLANF will take very less total negotiation time due to complicated negotiation mechanisms using a third-party broker agent. Also, a novel game theory decision system will suggest an optimal solution to the negotiating agent at the time of generating a proposal or counter proposal. This optimal suggestion will make the negotiating party aware of the optimal acceptance range of the proposal and avoid the negotiation break off by quickly reaching an agreement.

Dynamic Task Scheduling Strategy with Game Theory in Wireless Sensor Networks

2014 ◽  
Vol 10 (03) ◽  
pp. 211-224 ◽  
Author(s):  
Wenzhong Guo ◽  
Ying Chen ◽  
Guolong Chen
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
High Performance Computing ◽  
Task Allocation ◽  
High Performance ◽  
Wireless Sensor ◽  
Dynamic Task ◽  
The Game Theory ◽  
Performance Computing ◽  
Dynamic Task Scheduling

Task allocation and scheduling is an important typical problem in the area of high performance computing. Unfortunately, the existing traditional solutions to this problem in high performance computing cannot be directly implemented in wireless sensor networks (WSNs) due to the limitations of WSNs such as resource availability and shared communication medium. In this paper, a dynamic task scheduling strategy with the application of the game theory in WSNs is presented. First, an effective parallel alliance generating algorithm is proposed to process the multi-tasks environment. A task allocation algorithm based on the game theory is used to enhance the performance of the network. A novel resource conflict eliminating algorithm is also developed to eliminate the conflicting issues. Finally, the simulation results confirm and reassure the effectiveness of our proposed scheme as we compare with that of the other schema's available in the public domain.

Reputation and Gossip in Game Theory

2019 ◽  
pp. 213-229
Author(s):  
Charles Roddie
Keyword(s):  
Game Theory ◽  
Strategic Behavior ◽  
Third Party ◽  
The Past ◽  
Past Behavior ◽  
Future Behavior ◽  
The Game Theory ◽  
Shed Light

When interacting with others, it is often important for you to know what they have done in similar situations in the past: to know their reputation. One reason is that their past behavior may be a guide to their future behavior. A second reason is that their past behavior may have qualified them for reward and cooperation, or for punishment and revenge. The fact that you respond positively or negatively to the reputation of others then generates incentives for them to maintain good reputations. This article surveys the game theory literature which analyses the mechanisms and incentives involved in reputation. It also discusses how experiments have shed light on strategic behavior involved in maintaining reputations, and the adequacy of unreliable and third party information (gossip) for maintaining incentives for cooperation.

scholarly journals The Superiority of Quantum Strategy in 3-Player Prisoner’s Dilemma

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1443
Author(s):  
Zhiyuan Dong ◽  
Ai-Guo Wu
Keyword(s):  
Game Theory ◽  
Prisoner's Dilemma ◽  
Prisoner’S Dilemma ◽  
Quantum Game ◽  
Final State ◽  
The Game Theory ◽  
Initial States ◽  
Quantum Strategy ◽  
Selection Of

In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.

scholarly journals Multi-Robot Searching using Game-Theory Based Approach

10.5772/6232 ◽  
2008 ◽  
Vol 5 (4) ◽  
pp. 44 ◽  
Author(s):  
Yan Meng
Keyword(s):  
Game Theory ◽  
Dynamic Programming ◽  
Utility Function ◽  
Real Time ◽  
Dynamic Environment ◽  
Equilibrium Solutions ◽  
Strategy Equilibrium ◽  
The Game Theory ◽  
Target Searching ◽  
Multi Robot

This paper proposes a game-theory based approach in a multi–target searching using a multi-robot system in a dynamic environment. It is assumed that a rough priori probability map of the targets' distribution within the environment is given. To consider the interaction between the robots, a dynamic-programming equation is proposed to estimate the utility function for each robot. Based on this utility function, a cooperative nonzero-sum game is generated, where both pure Nash Equilibrium and mixed-strategy Equilibrium solutions are presented to achieve an optimal overall robot behaviors. A special consideration has been taken to improve the real-time performance of the game-theory based approach. Several mechanisms, such as event-driven discretization, one-step dynamic programming, and decision buffer, have been proposed to reduce the computational complexity. The main advantage of the algorithm lies in its real-time capabilities whilst being efficient and robust to dynamic environments.

scholarly journals Cooperative n-person Prisoner's Dilemma on a Network

2021 ◽  
Vol 14 ◽  
pp. 122-126
Author(s):  
Aleksandra L. Grinikh ◽  
◽  
Leon A. Petrosyan ◽  
Keyword(s):  
Game Theory ◽  
Cooperative Game ◽  
Prisoner's Dilemma ◽  
Prisoner’S Dilemma ◽  
Pairwise Interaction ◽  
Network Interaction ◽  
The Game Theory

In the paper n-person prisoner's dilemma on the network is investigated. A cooperative game with the pairwise interaction of players is constructed. The model is a modification of the classic 2-person prisoner's dilemma problem in the game theory. Network interaction provide an ability to take into account the in uence only to the adjacent players from the whole set of players. The feature of the game is found that allows to make a decision about necessity of playing dominated strategy by a few players. This solution is based on the number of the adjacent players. The work is a continuation of the paper published earlier by Grinikh A.L. and Petrosyan L.A. in 2021.

scholarly journals Effective decisions for individualized assessment and minimization of the risk of unfriendly takeover of enterprises: the features of the game theory application

2019 ◽  
Vol 17 (1) ◽  
pp. 370-379
Author(s):  
Oksana Korolovych ◽  
Olha Chabaniuk ◽  
Natalia Ostapiuk ◽  
Yurii Kotviakovskyi ◽  
Nelia Gut
Keyword(s):  
Game Theory ◽  
External Environment ◽  
Point Of View ◽  
Control Moment ◽  
The Game Theory ◽  
Antagonistic Game ◽  
Target Company ◽  
Legislative Framework ◽  
Theory Application ◽  
Detailed Assessment

The conditions for doing business at this stage are often similar in a game in which you need to calculate your actions a few steps ahead. At the same time, it is important to highlight several possible current options and make the necessary decision at the control moment. Moreover, each of the options formed should be justified, understandable and take into account the risk factors and available resources.Today, the main problem of assessing and minimizing the risk of “unfriendly takeover” is due to the fact that in most cases the raider is a player who acts quite legitimately and relies on the loopholes of the current legislative framework. Therefore, it is easier to identify possible actions of the raider and to avoid them within the limits of the reverse game than to deal with the consequences.The purpose of the research is to study the specificity of the individualized assessment and minimization of the risk of “unfriendly takeover” by using elements of game theory.It has been taken into account that the effect of individualization in assessing the risk of unfriendly takeover of enterprises can possibly be achieved on the basis of the application of game theory, the elements of which provide simulation of the unfriendly takeover process within the mathematical description of the inherent combinations of attack/defence as if they actually occurred in time both within one state of the external environment and for their given set.The results allowed forming mathematical decision-making models based on the elements of the antagonistic game “raider-target enterprise” and “raider games with the external environment”, which proved the possibility to: 1) identify possible functions of wins/losses; 2) combinations of attacks that can be neglected (that is, from the point of view of the rationality of decisions, will be rejected by the raider); 3) the ranking of the raider’s “attack combinations” for the reliability of their use during “unfriendly takeover”. Under such conditions, the target company can provide not only a detailed assessment, but also an effective minimization of the risk of “unfriendly takeover” and allocate the best combination of protection.

Sign in / Sign up

Export Citation Format

Share Document