Talk:Arrow's impossibility theorem: Difference between revisions
→Finding EPOV on Arrow
Dr. Edmonds (talk | contribs) |
|||
Line 89:
:::::::: Quote from Dr. Edmonds: "Score has a built in assumption that candidates will not be added and removed." With such an assumption, it may be possible to make many ranked methods evade Arrow's Theorem as well. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 02:07, 21 March 2020 (UTC)
::::::::: Well if you can formalize and prove that then there is a Nobel Prize in it for you. Social choice theory generally assumes that the choices come as part of the problem. This is one criticism of the whole field. We are going pretty far off topic. Lets move this to a forum. --[[User:Dr. Edmonds|Dr. Edmonds]] ([[User talk:Dr. Edmonds|talk]]) 05:22, 21 March 2020 (UTC)
| |||