TY - GEN
T1 - Signed graph games
T2 - 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
AU - Skibski, Oskar
AU - Suzuki, Takamasa
AU - Grabowski, Tomasz
AU - Michalak, Tomasz
AU - Yokoo, Makoto
N1 - Funding Information:
Oskar Skibski and Tomasz Michalak were supported by the Polish National Science Centre grant 2015/19/D/ST6/03113. This work is partially supported by JSPS KAKENHI Grant JP17H00761 and JST SICORP JPMJSC1607.
Publisher Copyright:
© 2020 International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). All rights reserved.
PY - 2020
Y1 - 2020
N2 - The ability to cooperate is one of the key features of many multiagent systems. In this paper, we extend the well-known model of graph-restricted games due to Myerson to signed graphs, where the link between any two players may be either positive or negative. Hence, in our model, it is possible to explicitly define not only that some players are friends (as in Myerson's model) but also that some other players are enemies. As such our games can express a wider range of situations, e.g., animosities between political parties. We say that a coalition is feasible if every two players are connected by a path of positive edges and no two players are connected by a negative edge. We define the value for signed graph games using the axiomatic approach that closely follows the celebrated characterisation of the Myerson value. Furthermore, we propose an algorithm for computing an arbitrary semivalue, including the one proposed by us. Moreover, we consider signed graph games with a priori defined alliances (unions) between players and propose an algorithm for the extension of the Owen value to this setting.
AB - The ability to cooperate is one of the key features of many multiagent systems. In this paper, we extend the well-known model of graph-restricted games due to Myerson to signed graphs, where the link between any two players may be either positive or negative. Hence, in our model, it is possible to explicitly define not only that some players are friends (as in Myerson's model) but also that some other players are enemies. As such our games can express a wider range of situations, e.g., animosities between political parties. We say that a coalition is feasible if every two players are connected by a path of positive edges and no two players are connected by a negative edge. We define the value for signed graph games using the axiomatic approach that closely follows the celebrated characterisation of the Myerson value. Furthermore, we propose an algorithm for computing an arbitrary semivalue, including the one proposed by us. Moreover, we consider signed graph games with a priori defined alliances (unions) between players and propose an algorithm for the extension of the Owen value to this setting.
UR - http://www.scopus.com/inward/record.url?scp=85096679807&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85096679807&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85096679807
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1287
EP - 1295
BT - Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2020
A2 - An, Bo
A2 - El Fallah Seghrouchni, Amal
A2 - Sukthankar, Gita
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Y2 - 19 May 2020
ER -