Average submodularity of maximizing anticoordination in network games

DOI10.1137/22M1506614MaRDI QIDQ6622707

Soham Das, Ceyhun Eksin

Publication date: 22 October 2024

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

game theorygames on graphsapproximation algorithmssubmodular optimizationanticoordination games

Mathematics Subject Classification ID

Games involving graphs (91A43) Rationality and learning in game theory (91A26) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Anti-coordination and social interactions
• Public goods in networks
• Opinion influence and evolution in social networks: a Markovian agents model
• Network games: theory, models, and dynamics
• The Design of Approximation Algorithms
• Submodularity of Influence in Social Networks: From Local to Global
• Network Games
• An analysis of approximations for maximizing submodular set functions—I
• Studies on Robust Social Influence Mechanisms: Incentives for Efficient Network Routing in Uncertain Settings
• Control of Learning in Anticoordination Network Games
• Incentive-Based Control of Asynchronous Best-Response Dynamics on Binary Decision Networks
• Game Theoretic Control of Multiagent Systems
• Opinion Dynamics in Social Networks through Mean-Field Games
• Optimal Targeting in Super-Modular Games
• Maximizing social welfare and agreement via information design in linear-quadratic-Gaussian games

This page was built for publication: Average submodularity of maximizing anticoordination in network games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622707)