7 citations · 8 across the 4 of their papers we have counts for
4 papers
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice
Ben Abramowitz, Elliot Anshelevich, Wennan Zhu
We develop new voting mechanisms for the case when voters and candidates are located in an arbitrary unknown metric space, and the goal is to choose a candidate minimizing social c…
Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version
Ben Abramowitz, Elliot Anshelevich
We consider ordinal approximation algorithms for a broad class of utility maximization problems for multi-agent systems. In these problems, agents have utilities for connecting to…
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
Elliot Anshelevich, Wennan Zhu
We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their prefe…
Seeding Influential Nodes in Non-Submodular Models of Information Diffusion
Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail
We consider the model of information diffusion in social networks from \cite{Hui2010a} which incorporates trust (weighted links) between actors, and allows actors to actively parti…