Learning to Manipulate under Limited Information
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915165632462848 |
|---|---|
| author | Holliday, Wesley H. Kristoffersen, Alexander Pacuit, Eric |
| author_facet | Holliday, Wesley H. Kristoffersen, Alexander Pacuit, Eric |
| contents | By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to such strategic manipulation has become a key consideration for comparing voting methods. Here we measure resistance to manipulation by whether neural networks of various sizes can learn to profitably manipulate a given voting method in expectation, given different types of limited information about how other voters will vote. We trained over 100,000 neural networks of 26 sizes to manipulate against 8 different voting methods, under 6 types of limited information, in committee-sized elections with 5-21 voters and 3-6 candidates. We find that some voting methods, such as Borda, are highly manipulable by networks with limited information, while others, such as Instant Runoff, are not, despite being quite profitably manipulated by an ideal manipulator with full information. For the three probability models for elections that we use, the overall least manipulable of the 8 methods we study are Condorcet methods, namely Minimax and Split Cycle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_16412 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Learning to Manipulate under Limited Information Holliday, Wesley H. Kristoffersen, Alexander Pacuit, Eric Artificial Intelligence Computer Science and Game Theory Machine Learning Multiagent Systems Theoretical Economics 91B12, 91B14, 91B10, 68T07 I.2.6; I.2.11 By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to such strategic manipulation has become a key consideration for comparing voting methods. Here we measure resistance to manipulation by whether neural networks of various sizes can learn to profitably manipulate a given voting method in expectation, given different types of limited information about how other voters will vote. We trained over 100,000 neural networks of 26 sizes to manipulate against 8 different voting methods, under 6 types of limited information, in committee-sized elections with 5-21 voters and 3-6 candidates. We find that some voting methods, such as Borda, are highly manipulable by networks with limited information, while others, such as Instant Runoff, are not, despite being quite profitably manipulated by an ideal manipulator with full information. For the three probability models for elections that we use, the overall least manipulable of the 8 methods we study are Condorcet methods, namely Minimax and Split Cycle. |
| title | Learning to Manipulate under Limited Information |
| topic | Artificial Intelligence Computer Science and Game Theory Machine Learning Multiagent Systems Theoretical Economics 91B12, 91B14, 91B10, 68T07 I.2.6; I.2.11 |
| url | https://arxiv.org/abs/2401.16412 |