default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElliot Anshelevich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Md. Ibrahim Ibne Alam
, Elliot Anshelevich, Koushik Kar, Murat Yuksel:
Pricing for Efficient Traffic Exchange at IXPs. IEEE/ACM Trans. Netw. 32(3): 2053-2068 (2024)- [c53]Elliot Anshelevich, Aris Filos-Ratsikas, Christopher Jerrett, Alexandros A. Voudouris:
Improved Metric Distortion via Threshold Approvals. AAAI 2024: 9460-9468 - [i26]Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros A. Voudouris:
Metric Distortion under Group-Fair Objectives. CoRR abs/2404.14180 (2024) - [i25]Christopher Jerrett, Yue Han, Elliot Anshelevich:
Metric Distortion of Line-up Elections: The Right Person for the Right Job. CoRR abs/2405.04020 (2024) - 2023
- [c52]Yue Han, Christopher Jerrett, Elliot Anshelevich:
Optimizing Multiple Simultaneous Objectives for Voting and Facility Location. AAAI 2023: 5665-5672 - [i24]Elliot Anshelevich, Aris Filos-Ratsikas, Christopher Jerrett, Alexandros A. Voudouris:
Improved Metric Distortion via Threshold Approvals. CoRR abs/2305.14024 (2023) - 2022
- [j33]Elliot Anshelevich, Aris Filos-Ratsikas, Alexandros A. Voudouris:
The distortion of distributed metric social choice. Artif. Intell. 308: 103713 (2022) - [c51]Md. Ibrahim Ibne Alam, Elliot Anshelevich, Koushik Kar:
Port Capacity Leasing Games at Internet Exchange Points. GAMENETS 2022: 251-262 - [i23]Yue Han, Christopher Jerrett, Elliot Anshelevich:
Optimizing Multiple Simultaneous Objectives for Voting and Facility Location. CoRR abs/2212.03467 (2022) - 2021
- [j32]Elliot Anshelevich, Aris Filos-Ratsikas, Nisarg Shah, Alexandros A. Voudouris:
Distortion in social choice problems: an annotated reading list. SIGecom Exch. 19(1): 12-14 (2021) - [j31]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. ACM Trans. Economics and Comput. 9(2): 9:1-9:24 (2021) - [c50]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. AAAI 2021: 5086-5093 - [c49]Elliot Anshelevich, Wennan Zhu:
Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs). AAAI 2021: 5094-5101 - [c48]Md. Ibrahim Ibne Alam, Koushik Kar, Elliot Anshelevich:
Balancing Traffic Flow Efficiency with IXP Revenue in Internet Peering. GLOBECOM 2021: 1-6 - [c47]Elliot Anshelevich, Aris Filos-Ratsikas, Nisarg Shah, Alexandros A. Voudouris:
Distortion in Social Choice Problems: The First 15 Years and Beyond. IJCAI 2021: 4294-4301 - [c46]Md. Ibrahim Alam, Elliot Anshelevich, Koushik Kar, Murat Yuksel:
Proportional Pricing for Efficient Traffic Equilibrium at Internet Exchange Points. ITC 2021: 1-9 - [c45]Elliot Anshelevich, Aris Filos-Ratsikas, Alexandros A. Voudouris:
The Distortion of Distributed Metric Social Choice. WINE 2021: 467-485 - [i22]Elliot Anshelevich, Aris Filos-Ratsikas, Nisarg Shah, Alexandros A. Voudouris:
Distortion in Social Choice Problems: The First 15 Years and Beyond. CoRR abs/2103.00911 (2021) - [i21]Elliot Anshelevich, Aris Filos-Ratsikas, Alexandros A. Voudouris:
The Distortion of Distributed Metric Social Choice. CoRR abs/2107.05456 (2021) - 2020
- [i20]Elliot Anshelevich, Wennan Zhu:
Forming better stable solutions in Group Formation Games inspired by Internet Exchange Points (IXPs). CoRR abs/2008.12235 (2020) - [i19]Elliot Anshelevich, Zack Fitzsimmons, Rohit Vaish, Lirong Xia:
Representative Proxy Voting. CoRR abs/2012.06747 (2020)
2010 – 2019
- 2019
- [j30]Elliot Anshelevich, Onkar Bhardwaj, Koushik Kar:
Strategic Network Formation Through an Intermediary. Theory Comput. Syst. 63(6): 1314-1335 (2019) - [j29]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. Theory Comput. Syst. 63(7): 1499-1530 (2019) - [c44]Ben Abramowitz, Elliot Anshelevich, Wennan Zhu:
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice. WINE 2019: 3-16 - [i18]Ben Abramowitz, Elliot Anshelevich, Wennan Zhu:
Awareness of Voter Passion Greatly Improves the Distortion of Metric Social Choice. CoRR abs/1906.10562 (2019) - 2018
- [j28]Elliot Anshelevich, Onkar Bhardwaj, Edith Elkind, John Postl, Piotr Skowron:
Approximating optimal social choice under metric preferences. Artif. Intell. 264: 27-51 (2018) - [c43]Ben Abramowitz, Elliot Anshelevich:
Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems Using Only Ordinal Preferences. AAAI 2018: 894-901 - [c42]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions. WINE 2018: 3-20 - [i17]Elliot Anshelevich, Wennan Zhu:
Ordinal Approximation for Social Choice, Matching, and Facility Location Problems given Candidate Positions. CoRR abs/1805.03103 (2018) - 2017
- [j27]Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer:
Stable Matching with Network Externalities. Algorithmica 78(3): 1067-1106 (2017) - [j26]Elliot Anshelevich, John Postl:
Randomized Social Choice Functions Under Metric Preferences. J. Artif. Intell. Res. 58: 797-827 (2017) - [j25]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. ACM Trans. Economics and Comput. 5(3): 16:1-16:42 (2017) - [c41]Stephen Gross, Elliot Anshelevich, Lirong Xia:
Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity. AAAI 2017: 544-550 - [c40]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. SAGT 2017: 267-279 - [c39]Elliot Anshelevich, Shreyas Sekar:
Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing. EC 2017: 325-342 - [c38]Elliot Anshelevich, Koushik Kar, Shreyas Sekar, Zaid Bin Tariq:
Balancing social utility with aggregator profit in electric vehicle charging. SmartGridComm 2017: 369-374 - [i16]Elliot Anshelevich, Wennan Zhu:
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching. CoRR abs/1707.01608 (2017) - [i15]Ben Abramowitz, Elliot Anshelevich:
Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version. CoRR abs/1711.10588 (2017) - 2016
- [j24]Onkar Bhardwaj, Elliot Anshelevich, Koushik Kar:
Coalitionally stable pricing schemes for inter-domain forwarding. Comput. Networks 97: 128-146 (2016) - [j23]Elliot Anshelevich, John Postl, Tom Wexler:
Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness. Theory Comput. Syst. 59(3): 440-475 (2016) - [j22]Elliot Anshelevich, John Postl:
Profit Sharing with Thresholds and Non-monotone Player Utilities. Theory Comput. Syst. 59(4): 563-580 (2016) - [j21]Elliot Anshelevich:
Ordinal approximation in matching and social choice. SIGecom Exch. 15(1): 60-64 (2016) - [c37]Elliot Anshelevich, Shreyas Sekar:
Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information. AAAI 2016: 390-396 - [c36]Elliot Anshelevich, John Postl:
Randomized Social Choice Functions under Metric Preferences. IJCAI 2016: 46-59 - [c35]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets. WINE 2016: 145-159 - [c34]Elliot Anshelevich, Shreyas Sekar:
Truthful Mechanisms for Matching and Clustering in an Ordinal World. WINE 2016: 265-278 - [i14]Elliot Anshelevich, Shreyas Sekar:
Truthful Mechanisms for Matching and Clustering in an Ordinal World. CoRR abs/1610.04069 (2016) - [i13]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets. CoRR abs/1610.04071 (2016) - [i12]Elliot Anshelevich, Shreyas Sekar:
Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing. CoRR abs/1611.02442 (2016) - 2015
- [j20]Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail:
Seeding influential nodes in non-submodular models of information diffusion. Auton. Agents Multi Agent Syst. 29(1): 131-159 (2015) - [j19]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg strategy for routing flow over time. Games Econ. Behav. 92: 232-247 (2015) - [j18]Elliot Anshelevich, Onkar Bhardwaj, Michael Usher:
Friend of My Friend: Network Formation with Two-Hop Benefit. Theory Comput. Syst. 57(3): 711-752 (2015) - [c33]Elliot Anshelevich, Onkar Bhardwaj, John Postl:
Approximating Optimal Social Choice under Metric Preferences. AAAI 2015: 777-783 - [c32]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. ICALP (1) 2015: 52-64 - [c31]Elliot Anshelevich, Onkar Bhardwaj, Koushik Kar:
Strategic Network Formation through an Intermediary. IJCAI 2015: 447-453 - [c30]Elliot Anshelevich, Shreyas Sekar:
Price Competition in Networked Markets: How Do Monopolies Impact Social Welfare? WINE 2015: 16-30 - [c29]Elliot Anshelevich, Shreyas Sekar:
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing. WINE 2015: 31-45 - [i11]Elliot Anshelevich, Koushik Kar, Shreyas Sekar:
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. CoRR abs/1503.00340 (2015) - [i10]Elliot Anshelevich, Shreyas Sekar:
Computing Stable Coalitions: Approximation Algorithms for Reward Sharing. CoRR abs/1508.06781 (2015) - [i9]Elliot Anshelevich, Shreyas Sekar:
Blind, Greedy, and Random: Ordinal Approximation Algorithms for Graph Problems. CoRR abs/1512.05504 (2015) - [i8]Elliot Anshelevich, John Postl:
Randomized Social Choice Functions Under Metric Preferences. CoRR abs/1512.07590 (2015) - 2014
- [j17]Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. Theory Comput. Syst. 54(3): 407-430 (2014) - [j16]Elliot Anshelevich, Bugra Çaskurlu, Koushik Kar, Hang Zhang:
Capacity Allocation Games for Network-Coded Multicast Streaming. IEEE/ACM Trans. Netw. 22(2): 595-607 (2014) - [c28]Elliot Anshelevich, Shreyas Sekar:
Approximate Equilibrium and Incentivizing Social Coordination. AAAI 2014: 508-514 - [c27]Elliot Anshelevich, John Postl:
Profit Sharing with Thresholds and Non-monotone Player Utilities. SAGT 2014: 86-97 - [i7]Elliot Anshelevich, Shreyas Sekar:
Approximate Equilibrium and Incentivizing Social Coordination. CoRR abs/1404.4718 (2014) - [i6]Elliot Anshelevich, Shreyas Sekar:
Market price competition in networks: How do monopolies impact social welfare? CoRR abs/1410.1113 (2014) - 2013
- [j15]Elliot Anshelevich, Sanmay Das, Yonatan Naamad:
Anarchy, stability, and utopia: creating better matchings. Auton. Agents Multi Agent Syst. 26(1): 120-140 (2013) - [j14]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. Theory Comput. Syst. 52(2): 200-220 (2013) - [j13]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. Theory Comput. Syst. 53(1): 73-85 (2013) - [c26]Elliot Anshelevich, Meenal Chhabra, Sanmay Das, Matthew Gerrior:
On the Social Welfare of Mechanisms for Repeated Batch Matching. AAAI 2013: 60-66 - [c25]Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail:
Seeding influential nodes in non-submodular models of information diffusion. AAMAS 2013: 1305-1306 - [c24]Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer:
Friendship and Stable Matching. ESA 2013: 49-60 - [c23]Elliot Anshelevich, Onkar Bhardwaj, Michael Usher:
Friend of My Friend: Network Formation with Two-Hop Benefit. SAGT 2013: 62-73 - [i5]Elliot Anshelevich, Ameya Hate, Malik Magdon-Ismail:
Seeding Influential Nodes in Non-Submodular Models of Information Diffusion. CoRR abs/1302.5455 (2013) - [i4]Elliot Anshelevich, John Postl, Tom Wexler:
Assignment Games with Conflicts: Price of Total Anarchy and Convergence Results via Semi-Smoothness. CoRR abs/1304.5149 (2013) - 2012
- [j12]Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy:
Approximability of the Firefighter Problem - Computing Cuts over Time. Algorithmica 62(1-2): 520-536 (2012) - [j11]Elliot Anshelevich, Martin Hoefer:
Contribution Games in Networks. Algorithmica 63(1-2): 51-90 (2012) - [c22]Elliot Anshelevich, Meenal Chhabra, Matthew Gerrior, Sanmay Das:
On the social welfare of mechanisms for repeated batch matching. AAMAS 2012: 1321-1322 - [c21]Elliot Anshelevich, Ameya Hate, Koushik Kar, Michael Usher:
Stable and efficient pricing for inter-domain traffic forwarding. SIGMETRICS 2012: 381-382 - [i3]Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer:
Friendship, Altruism, and Reward Sharing in Stable Matching and Contribution Games. CoRR abs/1204.5780 (2012) - 2011
- [j10]Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic network formation through peering and service agreements. Games Econ. Behav. 73(1): 17-38 (2011) - [j9]Elliot Anshelevich, Bugra Çaskurlu:
Price of Stability in Survivable Network Design. Theory Comput. Syst. 49(1): 98-138 (2011) - [j8]Elliot Anshelevich, Adriana Karagiozova:
Terminal Backup, 3D Matching, and Covering Cubic Graphs. SIAM J. Comput. 40(3): 678-708 (2011) - [j7]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A competitive strategy for routing flow over time. SIGecom Exch. 10(2): 23-28 (2011) - [j6]Elliot Anshelevich, Bugra Çaskurlu:
Exact and approximate equilibria for optimal group network formation. Theor. Comput. Sci. 412(39): 5298-5314 (2011) - [c20]Elliot Anshelevich, Bugra Çaskurlu, Koushik Kar, Hang Zhang:
Capacity Allocation Games for Network-Coded Multicast Streaming. GAMENETS 2011: 658-673 - [c19]Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. SAGT 2011: 278-289 - [c18]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. SODA 2011: 192-201 - 2010
- [j5]Elliot Anshelevich, Sanmay Das:
Matching, cardinal utility, and social welfare. SIGecom Exch. 9(1): 4 (2010) - [c17]Elliot Anshelevich, Martin Hoefer:
Contribution Games in Social Networks. ESA (1) 2010: 158-169 - [c16]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games. SAGT 2010: 42-53 - [c15]Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate:
Strategic Multiway Cut and Multicut Games. WAOA 2010: 1-12 - [i2]Elliot Anshelevich, Martin Hoefer:
Contribution Games in Social Networks. CoRR abs/1004.1854 (2010) - [i1]Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time. CoRR abs/1010.3034 (2010)
2000 – 2009
- 2009
- [c14]Elliot Anshelevich, Bugra Çaskurlu:
Exact and Approximate Equilibria for Optimal Group Network Formation. ESA 2009: 239-250 - [c13]Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy:
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. ISAAC 2009: 974-983 - [c12]Elliot Anshelevich, Sanmay Das, Yonatan Naamad:
Anarchy, Stability, and Utopia: Creating Better Matchings. SAGT 2009: 159-170 - [c11]Elliot Anshelevich, Satish V. Ukkusuri:
Equilibria in Dynamic Selfish Routing. SAGT 2009: 171-182 - [c10]Elliot Anshelevich, Bugra Çaskurlu:
Price of Stability in Survivable Network Design. SAGT 2009: 208-219 - 2008
- [j4]Elliot Anshelevich, David Kempe, Jon M. Kleinberg:
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems. SIAM J. Comput. 37(5): 1656-1673 (2008) - [j3]Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden:
The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput. 38(4): 1602-1623 (2008) - [j2]Elliot Anshelevich, Lisa Zhang:
Path decomposition under a new cost measure with applications to optical network design. ACM Trans. Algorithms 4(1): 15:1-15:20 (2008) - [j1]Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler:
Near-Optimal Network Design with Selfish Agents. Theory Comput. 4(1): 77-109 (2008) - [c9]Dahai Xu, Elliot Anshelevich, Mung Chiang:
On Survivable Access Network Design: Complexity and Algorithms. INFOCOM 2008: 186-190 - [c8]Elliot Anshelevich, Gordon T. Wilfong:
Network Formation and Routing by Strategic Agents Using Local Contracts. WINE 2008: 386-393 - 2007
- [c7]Elliot Anshelevich, Adriana Karagiozova:
Terminal backup, 3D matching, and covering cubic graphs. STOC 2007: 391-400 - 2006
- [c6]Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic Network Formation through Peering and Service Agreements. FOCS 2006: 77-86 - 2005
- [b1]Elliot Anshelevich:
Network Design and Management with Strategic Agents. Cornell University, USA, 2005 - 2004
- [c5]Elliot Anshelevich, Lisa Zhang:
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design. ESA 2004: 28-39 - [c4]Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden:
The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004: 295-304 - 2003
- [c3]Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler:
Near-optimal network design with selfish agents. STOC 2003: 511-520 - 2002
- [c2]Elliot Anshelevich, David Kempe, Jon M. Kleinberg:
Stability of load balancing algorithms in dynamic adversarial systems. STOC 2002: 399-406 - 2000
- [c1]Elliot Anshelevich, Scott Owens, Florent Lamiraux, Lydia E. Kavraki:
Deformable Volumes in Path Planning Applications. ICRA 2000: 2290-2295
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
