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, Curry, Michael, Daskalakis, Constantinos, Demaine, Erik, Dickerson, John P, Hajiaghayi, MohammadTaghi, Hesterberg, Adam, Knittel, Marina, Milliff, Aidan, Intelligence, Assoc Advancement Artificial |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Political Science |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/138138 |
Similar Items
-
Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances
by: Chen, Jingkai, et al.
Published: (2022) -
The price of anarchy in network creation games
by: Demaine, Erik D, et al.
Published: (2019) -
The bidimensionality theory and its algorithmic applications
by: Hajiaghayi, MohammadTaghi
Published: (2006) -
Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks
by: Silver, Tom, et al.
Published: (2022) -
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
by: Bateni, MohammadHossein, et al.
Published: (2018)