{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:35:42Z","timestamp":1723016142543},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8]]},"abstract":"Coordination is often critical to forming prosocial behaviors -- behaviors that increase the overall sum of rewards received by all agents in a multi-agent game. However, state of the art reinforcement learning algorithms often suffer from converging to socially less desirable equilibria when multiple equilibria exist. Previous works address this challenge with explicit reward shaping, which requires the strong assumption that agents can be forced to be prosocial. We propose using a less restrictive peer-rewarding mechanism, gifting, that guides the agents toward more socially desirable equilibria while allowing agents to remain selfish and decentralized. Gifting allows each agent to give some of their reward to other agents. We employ a theoretical framework that captures the benefit of gifting in converging to the prosocial equilibrium by characterizing the equilibria's basins of attraction in a dynamical system. With gifting, we demonstrate increased convergence of high risk, general-sum coordination games to the prosocial equilibrium both via numerical analysis and experiments.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/61","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"434-442","source":"Crossref","is-referenced-by-count":8,"title":["Emergent Prosociality in Multi-Agent Games Through Gifting"],"prefix":"10.24963","author":[{"given":"Woodrow Z.","family":"Wang","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Mark","family":"Beliaev","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara"}]},{"given":"Erdem","family":"B\u0131y\u0131k","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Daniel A.","family":"Lazar","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara"}]},{"given":"Ramtin","family":"Pedarsani","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara"}]},{"given":"Dorsa","family":"Sadigh","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"10584","event":{"number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2021","name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","start":{"date-parts":[[2021,8,19]]},"theme":"Artificial Intelligence","location":"Montreal, Canada","end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:01:09Z","timestamp":1628679669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/61"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"http:\/\/dx.doi.org\/10.24963\/ijcai.2021\/61","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}
