XKCD on elections and voting
November 12th, 2009, by Tim Finin, posted in Humor, Social mediaAround here we prefer range voting to approval voting or IRV.

| Building intelligent systems in open, heterogeneous, dynamic, distributed environments |
range voting XKCD on elections and votingNovember 12th, 2009, by Tim Finin, posted in Humor, Social mediaAround here we prefer range voting to approval voting or IRV. ![]() Can range voting save us from politicians?August 21st, 2008, by Tim Finin, posted in Semantic Web, Social mediaThe short article Scoring the Candidates in the current Technology Review introduces the concept of range voting and argues that it would prevent third-party spoilers in elections as well as give voters more say, Arrow’s impossibility theorem notwithstanding. Heaven knows we need *something* to save us from modern political life, a least in the USA. The article describes ongoing research by our UMBC colleagues Alan Sherman and Rick Carback along with Warren Smith on voting technology. Of course the article points out that similar results were obtained by honeybees and also by the citizens of Sparta. Still, neither group submitted their work for peer review publications. Since votes are a fundamental mechanism for group decision making and collaboration, this approach might have wide applicability to social media. I wonder if there are any Semantic Web onologies out there that capture different voting systems. The site rangevoting.org has lots more information. |
| About Us | Contact Us | Site Map | Legal | Privacy Copyright © 1999 - 2009 UMBC ebiquity research group. Copyright © 2003 - 2009 Site design and RGB engine code by Filip Perich. XG Page generated in 0.083 seconds. |