Talk:Favorite betrayal criterion

From Wikipedia, the free encyclopedia

This article was nominated for deletion on 26 February 2006. The result of the discussion was delete.

This article was nominated for deletion on 11 March 2007. The result of the discussion was keep.

This article was nominated for deletion on 3 May 2007. The result of the discussion was keep.

[edit] Other satisfying methods

I added Minimax Condorcet using pairwise opposition since that method does exist on Wikipedia. I considered also adding Bucklin voting, but this requires that voters be able to rank candidates as equal, and with a specific (but commonly used) treatment of this type of vote, and this isn't discussed in the Bucklin article. KVenzke 03:01, 9 May 2007 (UTC)

Since all Condorcet systems fail, I would assume Minimax Condorcet does as well.Paladinwannabe2 23:32, 9 November 2007 (UTC)

Apparently it's a misnomer: depending on how it's set up, minimax can satisfy either Condorcet or Favorite Betrayal, but never both at the same time. Paladinwannabe2 23:43, 9 November 2007 (UTC)

[edit] Does this criteria matter?

Does this criteria have any relevance? How is this criteria significantly different from the monotonicity criterion? There are no examples listed of systems which fail monotonicity but pass 'favorite betrayal'. Paladinwannabe2 23:32, 9 November 2007 (UTC)

That's because it isn't possible for a system to fail monotonicity and pass favourite betrayal. There are plenty of systems that pass monotonicity and fail favourite betrayal, however, including Plurality, Borda, and a number of Condorcet systems.Jack Rudd (talk) 21:20, 22 May 2008 (UTC)