Talk:Computer science: Difference between revisions
Content added Content deleted
No edit summary |
(I agree with User:Psephomancy; it's not clear that an article with the current title makes sense on Electowiki) |
||
| Line 1: | Line 1: | ||
== Scope of this page == |
|||
I think a good idea for this page would be to include information on algorithms that pop up in multiple places i.e. Kemeny-Young attempts to check all possible rankings, compute a score for each, and find the highest-scored ranking, so if there's an algorithm that can do that and do something in other methods, it probably should be documented here. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 09:45, 19 March 2020 (UTC) |
I think a good idea for this page would be to include information on algorithms that pop up in multiple places i.e. Kemeny-Young attempts to check all possible rankings, compute a score for each, and find the highest-scored ranking, so if there's an algorithm that can do that and do something in other methods, it probably should be documented here. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 09:45, 19 March 2020 (UTC) |
||
| Line 6: | Line 8: | ||
:: I think this article could be a good place to talk about tractability i.e. here is how tractable the algorithms to handle optimal cardinal PR methods are, here is a quick way to calculate this part of a pairwise matrix if you have X information, etc. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 05:48, 24 March 2020 (UTC) |
:: I think this article could be a good place to talk about tractability i.e. here is how tractable the algorithms to handle optimal cardinal PR methods are, here is a quick way to calculate this part of a pairwise matrix if you have X information, etc. [[User:BetterVotingAdvocacy|BetterVotingAdvocacy]] ([[User talk:BetterVotingAdvocacy|talk]]) 05:48, 24 March 2020 (UTC) |
||
::: I agree with [[User:Psephomancy]]. There's not a great reason for Electowiki to have a [[Computer science]] article when Wikipedia already has one (at [[w:Computer science]]). There ''might'' be a reason for a generalized article about the algorithmic complexity of various election methods, but someone should try drafting the article in their user space, and then we can figure out where to move it. (hmmm...maybe a "Draft:" namespace like Wikipedia would be appropriate on Electowiki) -- [[User:RobLa|RobLa]] ([[User talk:RobLa|talk]]) 04:06, 25 March 2020 (UTC) |
|||
Revision as of 04:06, 25 March 2020
Scope of this page
I think a good idea for this page would be to include information on algorithms that pop up in multiple places i.e. Kemeny-Young attempts to check all possible rankings, compute a score for each, and find the highest-scored ranking, so if there's an algorithm that can do that and do something in other methods, it probably should be documented here. BetterVotingAdvocacy (talk) 09:45, 19 March 2020 (UTC)
- I'm inclined to think this article is also over-broad and shouldn't exist. Nothing wrong with articles about specific EM-related CS sub-topics, like Smith's BR simulations, but general-purpose topics belong on Wikipedia, not here. — Psephomancy (talk) 00:03, 20 March 2020 (UTC)
- My goal with such articles is to focus on showing the links between voting theory and the article topic, rather than to explicate the given topic. How would you suggest doing this? BetterVotingAdvocacy (talk) 00:38, 20 March 2020 (UTC)
- I think this article could be a good place to talk about tractability i.e. here is how tractable the algorithms to handle optimal cardinal PR methods are, here is a quick way to calculate this part of a pairwise matrix if you have X information, etc. BetterVotingAdvocacy (talk) 05:48, 24 March 2020 (UTC)
- I agree with User:Psephomancy. There's not a great reason for Electowiki to have a Computer science article when Wikipedia already has one (at w:Computer science). There might be a reason for a generalized article about the algorithmic complexity of various election methods, but someone should try drafting the article in their user space, and then we can figure out where to move it. (hmmm...maybe a "Draft:" namespace like Wikipedia would be appropriate on Electowiki) -- RobLa (talk) 04:06, 25 March 2020 (UTC)
- I think this article could be a good place to talk about tractability i.e. here is how tractable the algorithms to handle optimal cardinal PR methods are, here is a quick way to calculate this part of a pairwise matrix if you have X information, etc. BetterVotingAdvocacy (talk) 05:48, 24 March 2020 (UTC)