7 citations · 10 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.MA2017★ 1 cited
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…
cs.GT2017
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…