# Elliot Anshelevich

According to our database

Collaborative distances:

^{1}, Elliot Anshelevich authored at least 57 papers between 2000 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching.

Theory Comput. Syst., 2019

Strategic Network Formation Through an Intermediary.

Theory Comput. Syst., 2019

Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice.

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018

Approximating optimal social choice under metric preferences.

Artif. Intell., 2018

Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions.

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems Using Only Ordinal Preferences.

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare.

ACM Trans. Economics and Comput., 2017

Randomized Social Choice Functions Under Metric Preferences.

J. Artif. Intell. Res., 2017

Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version.

CoRR, 2017

Stable Matching with Network Externalities.

Algorithmica, 2017

Balancing social utility with aggregator profit in electric vehicle charging.

Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017

Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity.

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Ordinal approximation in matching and social choice.

SIGecom Exch., 2016

Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness.

Theory Comput. Syst., 2016

Profit Sharing with Thresholds and Non-monotone Player Utilities.

Theory Comput. Syst., 2016

Coalitionally stable pricing schemes for inter-domain forwarding.

Comput. Networks, 2016

Truthful Mechanisms for Matching and Clustering in an Ordinal World.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets.

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information.

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Friend of My Friend: Network Formation with Two-Hop Benefit.

Theory Comput. Syst., 2015

A Stackelberg strategy for routing flow over time.

Games Econ. Behav., 2015

Blind, Greedy, and Random: Ordinal Approximation Algorithms for Graph Problems.

CoRR, 2015

Seeding influential nodes in non-submodular models of information diffusion.

Auton. Agents Multi Agent Syst., 2015

Computing Stable Coalitions: Approximation Algorithms for Reward Sharing.

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Price Competition in Networked Markets: How Do Monopolies Impact Social Welfare?

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Approximating Optimal Social Choice under Metric Preferences.

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Capacity Allocation Games for Network-Coded Multicast Streaming.

IEEE/ACM Trans. Netw., 2014

Strategic Pricing in Next-Hop Routing with Elastic Demands.

Theory Comput. Syst., 2014

Market price competition in networks: How do monopolies impact social welfare?

CoRR, 2014

Approximate Equilibrium and Incentivizing Social Coordination.

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Partition Equilibrium Always Exists in Resource Selection Games.

Theory Comput. Syst., 2013

Strategic Multiway Cut and Multicut Games.

Theory Comput. Syst., 2013

Assignment Games with Conflicts: Price of Total Anarchy and Convergence Results via Semi-Smoothness

CoRR, 2013

Anarchy, stability, and utopia: creating better matchings.

Auton. Agents Multi Agent Syst., 2013

Friendship and Stable Matching.

Proceedings of the Algorithms - ESA 2013, 2013

2012

Friendship, Altruism, and Reward Sharing in Stable Matching and Contribution Games

CoRR, 2012

Contribution Games in Networks.

Algorithmica, 2012

Approximability of the Firefighter Problem - Computing Cuts over Time.

Algorithmica, 2012

Stable and efficient pricing for inter-domain traffic forwarding.

Proceedings of the ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, 2012

On the social welfare of mechanisms for repeated batch matching.

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Exact and approximate equilibria for optimal group network formation.

Theor. Comput. Sci., 2011

A competitive strategy for routing flow over time.

SIGecom Exch., 2011

Terminal Backup, 3D Matching, and Covering Cubic Graphs.

SIAM J. Comput., 2011

Price of Stability in Survivable Network Design.

Theory Comput. Syst., 2011

Strategic network formation through peering and service agreements.

Games Econ. Behav., 2011

2010

Matching, cardinal utility, and social welfare.

SIGecom Exch., 2010

Contribution Games in Social Networks.

Proceedings of the Algorithms, 2010

2009

Equilibria in Dynamic Selfish Routing.

Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Near-Optimal Network Design with Selfish Agents.

Theory Comput., 2008

Path decomposition under a new cost measure with applications to optical network design.

ACM Trans. Algorithms, 2008

Stability of Load Balancing Algorithms in Dynamic Adversarial Systems.

SIAM J. Comput., 2008

The Price of Stability for Network Design with Fair Cost Allocation.

SIAM J. Comput., 2008

Network Formation and Routing by Strategic Agents Using Local Contracts.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

On Survivable Access Network Design: Complexity and Algorithms.

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2000

Deformable Volumes in Path Planning Applications.

Proceedings of the 2000 IEEE International Conference on Robotics and Automation, 2000