Skip to content

Elliot Anshelevich

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

42

Venues

15

Active years

2000–2025

Best venue rank

A*

Where they publish

Papers

42 indexed papers, newest first.

YearVenueTitleAuthors
2025AAAIMetric Distortion of Line-up Elections: The Right Person for the Right Job.Christopher Jerrett, Yue Han, Elliot Anshelevich
2025SAGTMetric Distortion Under Group-Fair Objectives.Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros A. Voudouris
2025SAGTHotelling-Downs with Facility Synergy: The Mall Effect.Elliot Anshelevich, Jianan Lin, Noah Prisament
2024AAAIImproved Metric Distortion via Threshold Approvals.Elliot Anshelevich, Aris Filos-Ratsikas, Christopher Jerrett, Alexandros A. Voudouris
2023AAAIOptimizing Multiple Simultaneous Objectives for Voting and Facility Location.Yue Han, Christopher Jerrett, Elliot Anshelevich
2021AAAIRepresentative Proxy Voting.Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia
2021AAAIForming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs).Elliot Anshelevich, Wennan Zhu
2021GLOBECOMBalancing Traffic Flow Efficiency with IXP Revenue in Internet Peering.Md. Ibrahim Ibne Alam, Koushik Kar, Elliot Anshelevich
2021IJCAIDistortion in Social Choice Problems: The First 15 Years and Beyond.Elliot Anshelevich, Aris Filos-Ratsikas, Nisarg Shah, Alexandros A. Voudouris
2018AAAIUtilitarians Without Utilities: Maximizing Social Welfare for Graph Problems Using Only Ordinal Preferences.Ben Abramowitz, Elliot Anshelevich
2017AAAIVote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity.Stephen Gross, Elliot Anshelevich, Lirong Xia
2017SAGTTradeoffs Between Information and Ordinal Approximation for Bipartite Matching.Elliot Anshelevich, Wennan Zhu
2016AAAIBlind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information.Elliot Anshelevich, Shreyas Sekar
2016IJCAIRandomized Social Choice Functions under Metric Preferences.Elliot Anshelevich, John Postl
2015AAAIApproximating Optimal Social Choice under Metric Preferences.Elliot Anshelevich, Onkar Bhardwaj, John Postl
2015ICALPEnvy-Free Pricing in Large Markets: Approximating Revenue and Welfare.Elliot Anshelevich, Koushik Kar, Shreyas Sekar
2015IJCAIStrategic Network Formation through an Intermediary.Elliot Anshelevich, Onkar Bhardwaj, Koushik Kar
2014AAAIApproximate Equilibrium and Incentivizing Social Coordination.Elliot Anshelevich, Shreyas Sekar
2014SAGTProfit Sharing with Thresholds and Non-monotone Player Utilities.Elliot Anshelevich, John Postl
2013AAAIOn the Social Welfare of Mechanisms for Repeated Batch Matching.Elliot Anshelevich, Meenal Chhabra, Sanmay Das, Matthew Gerrior
2013ESAFriendship and Stable Matching.Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer
2013SAGTFriend of My Friend: Network Formation with Two-Hop Benefit.Elliot Anshelevich, Onkar Bhardwaj, Michael Usher
2012AAMASOn the social welfare of mechanisms for repeated batch matching.Elliot Anshelevich, Meenal Chhabra, Matthew Gerrior, Sanmay Das
2012SIGMETRICSStable and efficient pricing for inter-domain traffic forwarding.Elliot Anshelevich, Ameya Hate, Koushik Kar, Michael Usher
2011SODAA Stackelberg Strategy for Routing Flow over Time.Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
2011SAGTStrategic Pricing in Next-Hop Routing with Elastic Demands.Elliot Anshelevich, Ameya Hate, Koushik Kar
2010ESAContribution Games in Social Networks.Elliot Anshelevich, Martin Hoefer
2010SAGTPartition Equilibrium Always Exists in Resource Selection Games.Elliot Anshelevich, Bugra askurlu, Ameya Hate
2010WAOAStrategic Multiway Cut and Multicut Games.Elliot Anshelevich, Bugra askurlu, Ameya Hate
2009ESAExact and Approximate Equilibria for Optimal Group Network Formation.Elliot Anshelevich, Bugra askurlu
2009ISAACApproximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy
2009SAGTPrice of Stability in Survivable Network Design.Elliot Anshelevich, Bugra askurlu
2009SAGTAnarchy, Stability, and Utopia: Creating Better Matchings.Elliot Anshelevich, Sanmay Das, Yonatan Naamad
2009SAGTEquilibria in Dynamic Selfish Routing.Elliot Anshelevich, Satish V. Ukkusuri
2008INFOCOMOn Survivable Access Network Design: Complexity and Algorithms.Dahai Xu, Elliot Anshelevich, Mung Chiang
2007STOCTerminal backup, 3D matching, and covering cubic graphs.Elliot Anshelevich, Adriana Karagiozova
2006FOCSStrategic Network Formation through Peering and Service Agreements.Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
2004ESAPath Decomposition Under a New Cost Measure with Applications to Optical Network Design.Elliot Anshelevich, Lisa Zhang
2004FOCSThe Price of Stability for Network Design with Fair Cost Allocation.Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, va Tardos, Tom Wexler, Tim Roughgarden
2003STOCNear-optimal network design with selfish agents.Elliot Anshelevich, Anirban Dasgupta, va Tardos, Tom Wexler
2002STOCStability of load balancing algorithms in dynamic adversarial systems.Elliot Anshelevich, David Kempe, Jon M. Kleinberg
2000ICRADeformable Volumes in Path Planning Applications.Elliot Anshelevich, Scott Owens, Florent Lamiraux, Lydia E. Kavraki