IJCAI 2021poster19 citations
Distance Polymatrix Coordination Games
Alessandro Aloisio, Michele Flammini, Bojana Kodric, Cosimo Vinci
Abstract
In polymatrix coordination games, each player x is a node of a graph and must select an action in her strategy set. Nodes are playing separate bimatrix games with their neighbors in the graph. Namely, the utility of x is given by the preference she has for her action plus, for each neighbor y, a payoff which strictly depends on the mutual actions played by x and y. We propose the new class of distance polymatrix coordination games, properly generalizing polymatrix coordination games, in which the overall utility of player x further depends on the payoffs arising by mutual actions of players v,z that are the endpoints of edges at any distance h
Agent-based and Multi-agent Systems: Algorithmic Game TheoryAgent-based and Multi-agent Systems: Computational Social ChoiceAgent-based and Multi-agent Systems: Noncooperative Games
BibTeX
@inproceedings{ijcai2021p1,
title = {Distance Polymatrix Coordination Games},
author = {Aloisio, Alessandro and Flammini, Michele and Kodric, Bojana and Vinci, Cosimo},
booktitle = {Proceedings of the Thirtieth International Joint Conference on
Artificial Intelligence, {IJCAI-21}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Zhi-Hua Zhou},
pages = {3--9},
year = {2021},
month = {8},
note = {Main Track},
doi = {10.24963/ijcai.2021/1},
url = {https://doi.org/10.24963/ijcai.2021/1},
}