{"title":"放宽国际投资协定条件下的非博尔达选举","authors":"Gabriel Gendler","doi":"arxiv-2408.12661","DOIUrl":null,"url":null,"abstract":"Arrow's celebrated Impossibility Theorem asserts that an election rule, or\nSocial Welfare Function (SWF), between three or more candidates meeting a set\nof strict criteria cannot exist. Maskin suggests that Arrow's conditions for\nSWFs are too strict. In particular he weakens the \"Independence of Irrelevant\nAlternatives\" condition (IIA), which states that if in two elections, each\nvoter's binary preference between candidates $c_i$ and $c_j$ is the same, then\nthe two results must agree on their preference between $c_i$ and $c_j$.\nInstead, he proposes a modified IIA condition (MIIA). Under this condition, the\nresult between $c_i$ and $c_j$ can be affected not just by the order of $c_i$\nand $c_j$ in each voter's ranking, but also the number of candidates between\nthem. More candidates between $c_i$ and $c_j$ communicates some information\nabout the strength of a voter's preference between the two candidates, and\nMaskin argues that it should be admissible evidence in deciding on a final\nranking. We construct SWFs for three-party elections which meet the MIIA criterion\nalong with other sensibility criteria, but are far from being Borda elections\n(where each voter assigns a score to each candidate linearly according to their\nranking). On the other hand, we give cases in which any SWF must be the Borda\nrule.","PeriodicalId":501316,"journal":{"name":"arXiv - CS - Computer Science and Game Theory","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Non-Borda elections under relaxed IIA conditions\",\"authors\":\"Gabriel Gendler\",\"doi\":\"arxiv-2408.12661\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Arrow's celebrated Impossibility Theorem asserts that an election rule, or\\nSocial Welfare Function (SWF), between three or more candidates meeting a set\\nof strict criteria cannot exist. Maskin suggests that Arrow's conditions for\\nSWFs are too strict. In particular he weakens the \\\"Independence of Irrelevant\\nAlternatives\\\" condition (IIA), which states that if in two elections, each\\nvoter's binary preference between candidates $c_i$ and $c_j$ is the same, then\\nthe two results must agree on their preference between $c_i$ and $c_j$.\\nInstead, he proposes a modified IIA condition (MIIA). Under this condition, the\\nresult between $c_i$ and $c_j$ can be affected not just by the order of $c_i$\\nand $c_j$ in each voter's ranking, but also the number of candidates between\\nthem. More candidates between $c_i$ and $c_j$ communicates some information\\nabout the strength of a voter's preference between the two candidates, and\\nMaskin argues that it should be admissible evidence in deciding on a final\\nranking. We construct SWFs for three-party elections which meet the MIIA criterion\\nalong with other sensibility criteria, but are far from being Borda elections\\n(where each voter assigns a score to each candidate linearly according to their\\nranking). On the other hand, we give cases in which any SWF must be the Borda\\nrule.\",\"PeriodicalId\":501316,\"journal\":{\"name\":\"arXiv - CS - Computer Science and Game Theory\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computer Science and Game Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.12661\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computer Science and Game Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.12661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Arrow's celebrated Impossibility Theorem asserts that an election rule, or
Social Welfare Function (SWF), between three or more candidates meeting a set
of strict criteria cannot exist. Maskin suggests that Arrow's conditions for
SWFs are too strict. In particular he weakens the "Independence of Irrelevant
Alternatives" condition (IIA), which states that if in two elections, each
voter's binary preference between candidates $c_i$ and $c_j$ is the same, then
the two results must agree on their preference between $c_i$ and $c_j$.
Instead, he proposes a modified IIA condition (MIIA). Under this condition, the
result between $c_i$ and $c_j$ can be affected not just by the order of $c_i$
and $c_j$ in each voter's ranking, but also the number of candidates between
them. More candidates between $c_i$ and $c_j$ communicates some information
about the strength of a voter's preference between the two candidates, and
Maskin argues that it should be admissible evidence in deciding on a final
ranking. We construct SWFs for three-party elections which meet the MIIA criterion
along with other sensibility criteria, but are far from being Borda elections
(where each voter assigns a score to each candidate linearly according to their
ranking). On the other hand, we give cases in which any SWF must be the Borda
rule.