Learning Resilient Elections with Adversarial GNNs
Hao Xiang Li, Yash Shah, Lorenzo Giusti

TL;DR
This paper introduces a novel approach using adversarial graph neural networks to learn resilient voting rules that are robust against strategic manipulation, aiming to improve election fairness and social welfare.
Contribution
It generalizes the expressive power of learned voting rules by integrating bipartite graph representations and adversarial training within neural network architectures.
Findings
Enhanced robustness of voting rules against strategic voting.
Effective application demonstrated on synthetic and real-world datasets.
Improved social welfare outcomes in election simulations.
Abstract
In the face of adverse motives, it is indispensable to achieve a consensus. Elections have been the canonical way by which modern democracy has operated since the 17th century. Nowadays, they regulate markets, provide an engine for modern recommender systems or peer-to-peer networks, and remain the main approach to represent democracy. However, a desirable universal voting rule that satisfies all hypothetical scenarios is still a challenging topic, and the design of these systems is at the forefront of mechanism design research. Automated mechanism design is a promising approach, and recent works have demonstrated that set-invariant architectures are uniquely suited to modelling electoral systems. However, various concerns prevent the direct application to real-world settings, such as robustness to strategic voting. In this paper, we generalise the expressive capability of learned…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Ethics and Social Impacts of AI · Mobile Crowdsensing and Crowdsourcing
