2 citations · 4 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.GT2016
Condorcet-Consistent and Approximately Strategyproof Tournament Rules
Jon Schneider, Ariel Schvartzman, S. Matthew Weinberg
We consider the manipulability of tournament rules for round-robin tournaments of competitors. Specifically, competitors are competing for a prize, and a tournament rule $r…
cs.DS2016
Competitive analysis of the top-K ranking problem
Xi Chen, Sivakanth Gopi, Jieming Mao +1
Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top items from noisy pairwise c…