Elliot Anshelevich and Shreyas Sekar. Computing Stable Coalitions: Approximation Algorithms for Reward Sharing. Proc of 11th Conference on Web and Internet Economics (WINE 2015).
Elliot Anshelevich and Shreyas Sekar. Price Competition in Networked Markets: How do monopolies impact social welfare? Proc of 11th Conference on Web and Internet Economics (WINE 2015).
Elliot Anshelevich, Onkar Bhardwaj, and Koushik Kar. Strategic Network Formation through Intermediaries. Proc of 24th International Joint Conference on Artificial Intelligence (IJCAI 2015).
Elliot Anshelevich, Koushik Kar, and Shreyas Sekar. Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare. Proc of 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015).
Elliot Anshelevich, Onkar Bhardwaj, and John Postl. Approximating Optimal Social Choice under Metric Preferences. Proc. of 29th Conference on Artificial Intelligence (AAAI 2015).
Elliot Anshelevich, Ameya Hate, and Malik Magdon-Ismail. Seeding Influential Nodes in Non-Submodular Models of Information Diffusion. Journal of Autonomous Agents and Multi-Agent Systems, Volume 29, Issue 1 (2015), pages 131-159.
Elliot Anshelevich, Onkar Bhardwaj, and Michael Usher. Friend of My Friend: Network Formation with Two-Hop Benefit. Theory of Computing Systems, Volume 57, Issue 3 (2015), pages 711-752. Conference version appeared in SAGT 2013.
Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Stackelberg Strategy for Routing Flow over Time. Games and Economic Behavior, Volume 92, July 2015, pages 232-247. Conference version appeared in SODA 2011.
Elliot Anshelevich and John Postl. Profit Sharing with Thresholds and Non-monotone Player Utilities. Proc. of 7th International Symposium on Algorithmic Game Theory (SAGT 2014).
Elliot Anshelevich and Shreyas Sekar. Approximate Equilibrium and Incentivizing Social Coordination. Proc. of 28th Conference on Artificial Intelligence (AAAI 2014).
Elliot Anshelevich, Bugra Caskurlu, Koushik Kar, and Hang Zhang. Capacity Allocation Games for Network-Coded Multicast Streaming. IEEE/ACM Transactions on Networking, Volume 22, Number 2 (April 2014), pages 595-607.
Elliot Anshelevich, Ameya Hate, and Koushik Kar. Strategic Pricing in Next-hop Routing with Elastic Demands. Theory of Computing Systems, Volume 54, Issue 3 (2014), pages 407-430. Conference version appeared in SAGT 2011.
Elliot Anshelevich, Onkar Bhardwaj, and Michael Usher. Friend of My Friend: Network Formation with Two-Hop Benefit. Proc. of 6th International Symposium on Algorithmic Game Theory (SAGT 2013).
Elliot Anshelevich, Onkar Bhardwaj, and Martin Hoefer. Friendship and Stable Matching. (slides) Proc. 21st European Symposium on Algorithms (ESA 2013).
Elliot Anshelevich, Meenal Chhabra, Sanmay Das, and Matthew Gerrior. On the Social Welfare of Mechanisms for Repeated Batch Matching. Proc. 27th Conference on Artificial Intelligence (AAAI 2013).
Elliot Anshelevich, Bugra Caskurlu, and Ameya Hate. Partition Equilibrium Always Exists in Resource Selection Games. Theory of Computing Systems, Volume 53, Issue 1 (2013), pages 73-85. Conference version appeared in SAGT 2010.
Elliot Anshelevich, Bugra Caskurlu, and Ameya Hate. Strategic Multiway Cut and Multicut Games. Theory of Computing Systems, Volume 52, Issue 2 (2013), pages 200-220. Conference version appeared in WAOA 2010.
Elliot Anshelevich, Sanmay Das and Yonatan Naamad. Anarchy, Stability, and Utopia: Creating Better Matchings. Journal of Autonomous Agents and Multi-Agent Systems, Volume 26, Issue 1 (January 2013), pages 120-140. Conference version appeared in SAGT 2009.
Elliot Anshelevich and Martin Hoefer. Contribution Games in Social Networks. Algorithmica, Volume 63, Issue 1-2 (June 2012), pages 51-90. Conference version appeared in ESA 2010.
Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, and Chaitanya Swamy. Approximability of the Firefighter Problem: Computing Cuts over Time. Algorithmica, Volume 62, Issue 1 (2012), Pages 520-536. Conference version appeared in ISAAC 2009.
Elliot Anshelevich, Ameya Hate, and Koushik Kar. Strategic Pricing in Next-hop Routing with Elastic Demands. Proc. 4th International Symposium on Algorithmic Game Theory (SAGT 2011). Full version appears in Theory of Computing Systems.
Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Stackelberg Strategy for Routing Flow over Time. Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA 2011). Full version appeared in Games and Economic Behavior.
Elliot Anshelevich and Bugra Caskurlu. Exact and Approximate Equilibria for Optimal Group Network Formation. Theoretical Computer Science, Volume 412, Issue 39 (September 2011), pp. 5298-5314. Conference version appeared in ESA 2009.
Elliot Anshelevich and Bugra Caskurlu. Price of Stability in Survivable Network Design. Theory of Computing Systems, Volume 49, Number 1 (July 2011), pp. 98-138. Conference version appeared in SAGT 2009.
Elliot Anshelevich and Adriana Karagiozova. Terminal Backup, 3D Matching, and Covering Cubic Graphs. SIAM Journal on Computing, Volume 40, Issue 3 (2011), pp. 678-708. Conference version appeared in STOC 2007.
Elliot Anshelevich, Bruce Shepherd, and Gordon Wilfong. Strategic Network Formation through Peering and Service Agreements. Games and Economic Behavior, Volume 73, Issue 1, September 2011, Pages 17-38. Conference version appeared in FOCS 2006.
Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Competitive Strategy for Routing Flow over Time. Newsletter of the ACM Special Interest Group on E-commerce (SIGecom Exchanges), Volume 10.2, June 2011.