[EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-04 Thread Richard Fobes
Finally, after reading the articles cited by Warren Smith (listed at the bottom of this reply) plus some related articles, I can reply to his insistence that Condorcet-Kemeny calculations take too long to calculate. Also, this reply addresses the same claim that appears in Wikipedia both in th

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-04 Thread Warren Smith
On Sun, Mar 4, 2012 at 3:44 PM, Richard Fobes wrote: > Finally, after reading the articles cited by Warren Smith (listed at the > bottom of this reply) plus some related articles, I can reply to his > insistence that Condorcet-Kemeny calculations take too long to calculate. >  Also, this reply add

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-04 Thread Andrew Myers
On 3/4/12 5:44 PM, Warren Smith wrote: On Sun, Mar 4, 2012 at 3:44 PM, Richard Fobes wrote: Finally, after reading the articles cited by Warren Smith (listed at the bottom of this reply) plus some related articles, I can reply to his insistence that Condorcet-Kemeny calculations take too long

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-04 Thread Jameson Quinn
Remember that K-Y is Condorcet compliant, and I believe consistent as well (that is, you can generalize from Condorcet to Smith and even ignore the effects of the candidates outside the Smith set). So the set of cases where the problem is easy is at least somewhat well-defined in that sense, and pr

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-04 Thread Kristofer Munsterhjelm
On 03/05/2012 02:49 AM, Jameson Quinn wrote: Remember that K-Y is Condorcet compliant, and I believe consistent as well (that is, you can generalize from Condorcet to Smith and even ignore the effects of the candidates outside the Smith set). So the set of cases where the problem is easy is at le

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-31 Thread Kristofer Munsterhjelm
On 03/31/2012 08:24 AM, Richard Fobes wrote: So, wrapping up this explanation: If the Condorcet-Kemeny problem were in the field of encryption, then of course only an exact solution would be relevant. But the Condorcet-Kemeny problem is an optimization problem -- or it can be regarded as a sor

Re: [EM] Fast Condorcet-Kemeny calculation times, clarification of NP-hardness issue

2012-03-31 Thread Jameson Quinn
2012/3/31, Kristofer Munsterhjelm : > On 03/31/2012 08:24 AM, Richard Fobes wrote: > >> So, wrapping up this explanation: >> >> If the Condorcet-Kemeny problem were in the field of encryption, then of >> course only an exact solution would be relevant. >> >> But the Condorcet-Kemeny problem is an o