Scalable Equilibrium Computation in Multi-agent Influence Games on Networks
We provide a polynomial-time, scalable algorithm for equilibrium computation in multi-agent influence games on networks, extending work of Bindel, Kleinberg, and Oren (2015) from the single-agent to the multi-agent setting. In games of influence, agents have limited advertising budget to influence t...
Main Authors: | Christia, Fotini (Author), Curry, Michael (Author), Daskalakis, Constantinos (Author), Demaine, Erik (Author), Dickerson, John P (Author), Hajiaghayi, MohammadTaghi (Author), Hesterberg, Adam (Author), Knittel, Marina (Author), Milliff, Aidan (Author), Intelligence, Assoc Advancement Artificial (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2021-11-15T15:47:35Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The price of anarchy in network creation games
by: Demaine, Erik D, et al.
Published: (2019) -
Nutri-bullets: Summarizing Health Studies by Composing Segments
by: Shah, Darsh J, et al.
Published: (2022) -
An Information-Theoretic Framework for Unifying Active Learning Problems
by: Nguyen, Quoc Phong, et al.
Published: (2022) -
Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks
by: Silver, Tom, et al.
Published: (2022) -
PHASE: PHysically-grounded Abstract Social Events for Machine Social Perception
by: Netanyahu, Aviv, et al.
Published: (2021)