Elliot Anshelevich

Christopher Jerrett

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Optimizing Multiple Simultaneous Objectives for Voting and Facility Location.

[BibT_eX]

[DOI]

Yue Han

Christopher Jerrett

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

The distortion of distributed metric social choice.

[BibT_eX]

[DOI]

Artif. Intell., 2022

Port Capacity Leasing Games at Internet Exchange Points.

[BibT_eX]

[DOI]

Md. Ibrahim Ibne Alam

Proceedings of the Game Theory for Networks, 2022

2021

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

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Distortion in social choice problems: an annotated reading list.

[BibT_eX]

[DOI]

Nisarg Shah

SIGecom Exch., 2021

Proportional Pricing for Efficient Traffic Equilibrium at Internet Exchange Points.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Teletraffic Congress ITC 2021, Avignon, France, August 31, 2021

Distortion in Social Choice Problems: The First 15 Years and Beyond.

[BibT_eX]

[DOI]

Nisarg Shah

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Balancing Traffic Flow Efficiency with IXP Revenue in Internet Peering.

[BibT_eX]

[DOI]

Md. Ibrahim Ibne Alam

Proceedings of the IEEE Global Communications Conference, 2021

Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Representative Proxy Voting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2019

Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Strategic Network Formation Through an Intermediary.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

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

[BibT_eX]

[DOI]

Ben Abramowitz

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

2018

Approximating optimal social choice under metric preferences.

[BibT_eX]

[DOI]

Artif. Intell., 2018

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

[BibT_eX]

[DOI]

Ben Abramowitz

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

2017

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

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Randomized Social Choice Functions Under Metric Preferences.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2017

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

[BibT_eX]

[DOI]

Ben Abramowitz

CoRR, 2017

Stable Matching with Network Externalities.

[BibT_eX]

[DOI]

Algorithmica, 2017

Balancing social utility with aggregator profit in electric vehicle charging.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Stephen Gross

Lirong Xia

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

2016

Ordinal approximation in matching and social choice.

[BibT_eX]

[DOI]

SIGecom Exch., 2016

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

[BibT_eX]

[DOI]

Tom Wexler

Theory Comput. Syst., 2016

Profit Sharing with Thresholds and Non-monotone Player Utilities.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Coalitionally stable pricing schemes for inter-domain forwarding.

[BibT_eX]

[DOI]

Comput. Networks, 2016

Truthful Mechanisms for Matching and Clustering in an Ordinal World.

[BibT_eX]

[DOI]

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

Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

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

[BibT_eX]

[DOI]

Michael Usher

Theory Comput. Syst., 2015

A Stackelberg strategy for routing flow over time.

[BibT_eX]

[DOI]

Umang Bhaskar

Lisa Fleischer

Games Econ. Behav., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Malik Magdon-Ismail

Auton. Agents Multi Agent Syst., 2015

Computing Stable Coalitions: Approximation Algorithms for Reward Sharing.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Approximating Optimal Social Choice under Metric Preferences.

[BibT_eX]

[DOI]

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

2014

Capacity Allocation Games for Network-Coded Multicast Streaming.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

Strategic Pricing in Next-Hop Routing with Elastic Demands.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

Approximate Equilibrium and Incentivizing Social Coordination.

[BibT_eX]

[DOI]

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

2013

Partition Equilibrium Always Exists in Resource Selection Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Strategic Multiway Cut and Multicut Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

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

[BibT_eX]

[DOI]

Tom Wexler

CoRR, 2013

Anarchy, stability, and utopia: creating better matchings.

[BibT_eX]

[DOI]

Sanmay Das

Yonatan Naamad

Auton. Agents Multi Agent Syst., 2013

Friendship and Stable Matching.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

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

[BibT_eX]

[DOI]

CoRR, 2012

Contribution Games in Networks.

[BibT_eX]

[DOI]

Algorithmica, 2012

Approximability of the Firefighter Problem - Computing Cuts over Time.

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

Chaitanya Swamy

Algorithmica, 2012

Stable and efficient pricing for inter-domain traffic forwarding.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

2011

Exact and approximate equilibria for optimal group network formation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A competitive strategy for routing flow over time.

[BibT_eX]

[DOI]

Umang Bhaskar

Lisa Fleischer

SIGecom Exch., 2011

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

[BibT_eX]

[DOI]

Adriana Karagiozova

SIAM J. Comput., 2011

Price of Stability in Survivable Network Design.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Strategic network formation through peering and service agreements.

[BibT_eX]

[DOI]

F. Bruce Shepherd

Gordon T. Wilfong

Games Econ. Behav., 2011

2010

Matching, cardinal utility, and social welfare.

[BibT_eX]

[DOI]

Sanmay Das

SIGecom Exch., 2010

Contribution Games in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Equilibria in Dynamic Selfish Routing.

[BibT_eX]

[DOI]

Satish V. Ukkusuri

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

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

[BibT_eX]

[DOI]

Deeparnab Chakrabarty

Chaitanya Swamy

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

2008

Near-Optimal Network Design with Selfish Agents.

[BibT_eX]

[DOI]

Theory Comput., 2008

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

[BibT_eX]

[DOI]

Lisa Zhang

ACM Trans. Algorithms, 2008

Stability of Load Balancing Algorithms in Dynamic Adversarial Systems.

[BibT_eX]

[DOI]

David Kempe

Jon M. Kleinberg

SIAM J. Comput., 2008

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Network Formation and Routing by Strategic Agents Using Local Contracts.

[BibT_eX]

[DOI]

Gordon T. Wilfong

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

On Survivable Access Network Design: Complexity and Algorithms.

[BibT_eX]

[DOI]

Dahai Xu

Mung Chiang

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

2005

Network Design and Management with Strategic Agents.

[BibT_eX]