Back to Results
First PageMeta Content
Single winner electoral systems / Combinatorial optimization / Routing algorithms / Condorcet method / Depth-first search / Voting system / Graph / Directed acyclic graph / A* search algorithm / Graph theory / Mathematics / Search algorithms


A Computational Study of the Kemeny Rule for Preference Aggregation
Add to Reading List

Document Date: 2006-01-11 00:46:34

Open Document

File Size: 178,43 KB

Share Result on Facebook

City

Laval / New York / Paris / /

Company

Cambridge University Press / Kendall / /

Country

Canada / /

/

Facility

Institute of Mathematical Statistics / /

IndustryTerm

depth-first backtracking search / network flow solution / incremental algorithm / greedy heuristic procedure solutions / greedy algorithm / search engines / greedy solutions / search procedure / greedy heuristic solutions / heuristic algorithms / max-flow solution / bound search / search results / /

Organization

Cambridge University / Institute of Mathematical Statistics / Centre de Recherche / Jayant Kalagnanam IBM T.J.Watson Research Center / /

Person

John Wiley / Andrew Davenport / /

/

Position

Singer / rt / rt and rt / /

ProgrammingLanguage

C++ / /

ProvinceOrState

New York / /

PublishedMedium

Journal of Artificial Intelligence Research / Mathematics Magazine / Journal of Economic Theory / /

Technology

artificial intelligence / greedy algorithm / approximation algorithms / /

SocialTag