{"type":"ScholarlyArticle","title":"Distance Polymatrix Coordination Games","authors":[{"name":"Alessandro Aloisio","slug":"alessandro-aloisio","given":"Alessandro","family":"Aloisio","affiliation":""},{"name":"Michele Flammini","slug":"michele-flammini","given":"Michele","family":"Flammini","affiliation":""},{"name":"Bojana Kodric","slug":"bojana-kodric","given":"Bojana","family":"Kodric","affiliation":""},{"name":"Cosimo Vinci","slug":"cosimo-vinci","given":"Cosimo","family":"Vinci","affiliation":""}],"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.\r\n\r\nWe 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<d from x, for a fixed threshold value d≤n. In particular, the overall utility of player x is the sum of all the above payoffs, where each payoff is proportionally discounted by a factor depending on the distance h of the corresponding edge. \r\n\r\nUnder the above framework, which is a natural generalization that is well-suited for capturing positive community interactions, we study the social inefficiency of equilibria resorting to standard measures of Price of Anarchy and Price of Stability. Namely, we provide suitable upper and lower bounds for the aforementioned quantities, both for bounded-degree and general graphs.","doi":"10.24963/ijcai.2021/1","url":"https://ijcai.org/proceedings/2021/1","pdf":"https://ijcai.org/proceedings/2021/0001.pdf","markdown":"https://ijcai.org/proceedings/2021/1.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/1","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":1,"pages":{"first":3,"last":9},"keywords":["Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Noncooperative Games"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}