 | 2012 |
| 34 |  | Elliot Anshelevich,
Deeparnab Chakrabarty,
Ameya Hate,
Chaitanya Swamy:
Approximability of the Firefighter Problem - Computing Cuts over Time.
Algorithmica 62(1-2): 520-536 (2012) |
| 33 |  | Elliot Anshelevich,
Martin Hoefer:
Contribution Games in Networks.
Algorithmica 63(1-2): 51-90 (2012) |
| 32 |  | Elliot Anshelevich,
Onkar Bhardwaj,
Martin Hoefer:
Friendship, Altruism, and Reward Sharing in Stable Matching and Contribution Games
CoRR abs/1204.5780: (2012) |
| 2011 |
| 31 |  | Elliot Anshelevich,
Ameya Hate,
Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands.
SAGT 2011: 278-289 |
| 30 |  | Umang Bhaskar,
Lisa Fleischer,
Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time.
SODA 2011: 192-201 |
| 29 |  | Elliot Anshelevich,
F. Bruce Shepherd,
Gordon T. Wilfong:
Strategic network formation through peering and service agreements.
Games and Economic Behavior 73(1): 17-38 (2011) |
| 28 |  | Elliot Anshelevich,
Adriana Karagiozova:
Terminal Backup, 3D Matching, and Covering Cubic Graphs.
SIAM J. Comput. 40(3): 678-708 (2011) |
| 27 |  | Umang Bhaskar,
Lisa Fleischer,
Elliot Anshelevich:
A competitive strategy for routing flow over time.
SIGecom Exchanges 10(2): 23-28 (2011) |
| 26 |  | Elliot Anshelevich,
Bugra Caskurlu:
Exact and approximate equilibria for optimal group network formation.
Theor. Comput. Sci. 412(39): 5298-5314 (2011) |
| 25 |  | Elliot Anshelevich,
Bugra Caskurlu:
Price of Stability in Survivable Network Design.
Theory Comput. Syst. 49(1): 98-138 (2011) |
| 2010 |
| 24 |  | Elliot Anshelevich,
Martin Hoefer:
Contribution Games in Social Networks.
ESA (1) 2010: 158-169 |
| 23 |  | Elliot Anshelevich,
Bugra Caskurlu,
Ameya Hate:
Partition Equilibrium Always Exists in Resource Selection Games.
SAGT 2010: 42-53 |
| 22 |  | Elliot Anshelevich,
Bugra Caskurlu,
Ameya Hate:
Strategic Multiway Cut and Multicut Games.
WAOA 2010: 1-12 |
| 21 |  | Elliot Anshelevich,
Martin Hoefer:
Contribution Games in Social Networks
CoRR abs/1004.1854: (2010) |
| 20 |  | Umang Bhaskar,
Lisa Fleischer,
Elliot Anshelevich:
A Stackelberg Strategy for Routing Flow over Time
CoRR abs/1010.3034: (2010) |
| 19 |  | Elliot Anshelevich,
Sanmay Das:
Matching, cardinal utility, and social welfare.
SIGecom Exchanges 9(1): 4 (2010) |
| 2009 |
| 18 |  | Elliot Anshelevich,
Bugra Caskurlu:
Exact and Approximate Equilibria for Optimal Group Network Formation.
ESA 2009: 239-250 |
| 17 |  | Elliot Anshelevich,
Deeparnab Chakrabarty,
Ameya Hate,
Chaitanya Swamy:
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity.
ISAAC 2009: 974-983 |
| 16 |  | Elliot Anshelevich,
Sanmay Das,
Yonatan Naamad:
Anarchy, Stability, and Utopia: Creating Better Matchings.
SAGT 2009: 159-170 |
| 15 |  | Elliot Anshelevich,
Satish Ukkusuri:
Equilibria in Dynamic Selfish Routing.
SAGT 2009: 171-182 |
| 14 |  | Elliot Anshelevich,
Bugra Caskurlu:
Price of Stability in Survivable Network Design.
SAGT 2009: 208-219 |
| 2008 |
| 13 |  | Dahai Xu,
Elliot Anshelevich,
Mung Chiang:
On Survivable Access Network Design: Complexity and Algorithms.
INFOCOM 2008: 186-190 |
| 12 |  | Elliot Anshelevich,
Gordon T. Wilfong:
Network Formation and Routing by Strategic Agents Using Local Contracts.
WINE 2008: 386-393 |
| 11 |  | Elliot Anshelevich,
Lisa Zhang:
Path decomposition under a new cost measure with applications to optical network design.
ACM Transactions on Algorithms 4(1): (2008) |
| 10 |  | Elliot Anshelevich,
David Kempe,
Jon M. Kleinberg:
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems.
SIAM J. Comput. 37(5): 1656-1673 (2008) |
| 9 |  | 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) |
| 8 |  | Elliot Anshelevich,
Anirban Dasgupta,
Éva Tardos,
Tom Wexler:
Near-Optimal Network Design with Selfish Agents.
Theory of Computing 4(1): 77-109 (2008) |
| 2007 |
| 7 |  | Elliot Anshelevich,
Adriana Karagiozova:
Terminal backup, 3D matching, and covering cubic graphs.
STOC 2007: 391-400 |
| 2006 |
| 6 |  | Elliot Anshelevich,
F. Bruce Shepherd,
Gordon T. Wilfong:
Strategic Network Formation through Peering and Service Agreements.
FOCS 2006: 77-86 |
| 2004 |
| 5 |  | Elliot Anshelevich,
Lisa Zhang:
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design.
ESA 2004: 28-39 |
| 4 |  | 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 |
| 3 |  | Elliot Anshelevich,
Anirban Dasgupta,
Éva Tardos,
Tom Wexler:
Near-optimal network design with selfish agents.
STOC 2003: 511-520 |
| 2002 |
| 2 |  | Elliot Anshelevich,
David Kempe,
Jon M. Kleinberg:
Stability of load balancing algorithms in dynamic adversarial systems.
STOC 2002: 399-406 |
| 2000 |
| 1 |  | Elliot Anshelevich,
Scott Owens,
Florent Lamiraux,
Lydia E. Kavraki:
Deformable Volumes in Path Planning Applications.
ICRA 2000: 2290-2295 |