Hao Li, Lorenzo Giusti, Yash Shah
We lifted 5 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| MarkHaoxiang/geometric-governance | canonical | 0 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| get_scoring_function_winners | Not yet run | MarkHaoxiang/geometric-governance/src/geometric_governance/objective.py pointer only (licence: NONE) · get_code("a30a4fc7600cba33") |
| make_detached_clone | Not yet run | MarkHaoxiang/geometric-governance/src/geometric_governance/model/nn.py pointer only (licence: NONE) · get_code("6323f48b8c600f21") |
| moving_average | Not yet run | MarkHaoxiang/geometric-governance/src/geometric_governance/gen_appendix_welfare_plots.py pointer only (licence: NONE) · get_code("d5b7d53f7190f6e5") |
| moving_average | Not yet run | MarkHaoxiang/geometric-governance/src/geometric_governance/gen_welfare_loss_plots.py pointer only (licence: NONE) · get_code("7cdbeddbcee4e727") |
| sinkhorn | Not yet run | MarkHaoxiang/geometric-governance/src/geometric_governance/model/sinkhorn.py pointer only (licence: NONE) · get_code("6a6e9165af567cd8") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 voting rules, and combine improvements in neural network architecture with adversarial training to improve the resilience of voting rules while maximizing social welfare. We evaluate the effectiveness of our methods on both synthetic and real-world datasets. Our method resolves critical limitations of prior work regarding learning voting rules by representing elections using bipartite graphs, and learning such voting rules using graph neural networks. We believe this opens new frontiers for applying machine learning to real-world elections.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2601.01653")
get_code_for_paper("2601.01653")
have("2601.01653")
Connect an agent — have() is free.