3 citations · 9 across the 8 of their papers we have counts for
9 papers
Exclusion Zones of Instant Runoff Voting
Kiran Tomlinson, Johan Ugander, Jon Kleinberg
Recent research on instant runoff voting (IRV) shows that it exhibits a striking combinatorial property in one-dimensional preference spaces: there is an "exclusion zone" around th…
Replicating Electoral Success
Kiran Tomlinson, Tanvi Namjoshi, Johan Ugander +1
A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themsel…
The Moderating Effect of Instant Runoff Voting
Kiran Tomlinson, Johan Ugander, Jon Kleinberg
Instant runoff voting (IRV) has recently gained popularity as an alternative to plurality voting for political elections, with advocates claiming a range of advantages, including t…
Ballot Length in Instant Runoff Voting
Kiran Tomlinson, Johan Ugander, Jon Kleinberg
Instant runoff voting (IRV) is an increasingly-popular alternative to traditional plurality voting in which voters submit rankings over the candidates rather than single votes. In…
Graph-Based Methods for Discrete Choice
Kiran Tomlinson, Austin R. Benson
Choices made by individuals have widespread impacts--for instance, people choose between political candidates to vote for, between social media posts to share, and between brands t…
Choice Set Confounding in Discrete Choice
Kiran Tomlinson, Johan Ugander, Austin R. Benson
Standard methods in preference learning involve estimating the parameters of discrete choice models from data of selections (choices) made by individuals from a discrete set of alt…
Learning Interpretable Feature Context Effects in Discrete Choice
Kiran Tomlinson, Austin R. Benson
The outcomes of elections, product sales, and the structure of social connections are all determined by the choices individuals make when presented with a set of options, so unders…
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions
Patty Commins, David Liben-Nowell, Tina Liu +1
Algorithms to find optimal alignments among strings, or to find a parsimonious summary of a collection of strings, are well studied in a variety of contexts, addressing a wide rang…
Choice Set Optimization Under Discrete Choice Models of Group Decisions
Kiran Tomlinson, Austin R. Benson
The way that people make choices or exhibit preferences can be strongly affected by the set of available alternatives, often called the choice set. Furthermore, there are usually h…