| Publication | Date of Publication | Type |
|---|
The distortion of distributed metric social choice
Web and Internet Economics | 2022-07-06 | Paper |
The distortion of distributed metric social choice
Artificial Intelligence | 2022-06-01 | Paper |
Awareness of voter passion greatly improves the distortion of metric social choice
(available as arXiv preprint) | 2020-06-30 | Paper |
Ordinal approximation for social choice, matching, and facility location problems given candidate positions
(available as arXiv preprint) | 2020-06-18 | Paper |
Strategic network formation through an intermediary
Theory of Computing Systems | 2019-09-05 | Paper |
Tradeoffs between information and ordinal approximation for bipartite matching
Theory of Computing Systems | 2019-09-05 | Paper |
Approximating optimal social choice under metric preferences
Artificial Intelligence | 2019-03-19 | Paper |
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Tradeoffs between information and ordinal approximation for bipartite matching
Lecture Notes in Computer Science | 2018-02-13 | Paper |
Strategic pricing in next-hop routing with elastic demands
Theory of Computing Systems | 2017-11-07 | Paper |
Stable matching with network externalities
Algorithmica | 2017-10-09 | Paper |
| scientific article; zbMATH DE number 6783389 (Why is no real title available?) | 2017-09-29 | Paper |
Randomized social choice functions under metric preferences
Journal of Artificial Intelligence Research | 2017-05-16 | Paper |
Pricing to maximize revenue and welfare simultaneously in large markets
Web and Internet Economics | 2017-02-10 | Paper |
Truthful Mechanisms for Matching and Clustering in an Ordinal World
Web and Internet Economics | 2017-02-10 | Paper |
Profit sharing with thresholds and non-monotone player utilities
Theory of Computing Systems | 2017-02-01 | Paper |
Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
Theory of Computing Systems | 2017-01-12 | Paper |
Friend of my friend: network formation with two-hop benefit
Theory of Computing Systems | 2016-01-13 | Paper |
Computing stable coalitions: approximation algorithms for reward sharing
Web and Internet Economics | 2016-01-08 | Paper |
Price Competition in Networked Markets: How Do Monopolies Impact Social Welfare?
Web and Internet Economics | 2016-01-08 | Paper |
Envy-free pricing in large markets: approximating revenue and welfare
Automata, Languages, and Programming | 2015-10-27 | Paper |
A Stackelberg strategy for routing flow over time
Games and Economic Behavior | 2015-08-12 | Paper |
Profit sharing with thresholds and non-monotone player utilities
Algorithmic Game Theory | 2015-01-14 | Paper |
Friend of my friend: network formation with two-hop benefit
Algorithmic Game Theory | 2013-10-23 | Paper |
Partition equilibrium always exists in resource selection games
Theory of Computing Systems | 2013-10-21 | Paper |
Friendship and stable matching
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Strategic multiway cut and multicut games
Theory of Computing Systems | 2013-04-15 | Paper |
Approximability of the firefighter problem. Computing cuts over time
Algorithmica | 2012-04-26 | Paper |
Contribution games in networks
Algorithmica | 2012-04-26 | Paper |
Price of stability in survivable network design
Theory of Computing Systems | 2011-11-23 | Paper |
Strategic pricing in next-hop routing with elastic demands
Algorithmic Game Theory | 2011-10-28 | Paper |
Terminal backup, 3D matching, and covering cubic graphs
SIAM Journal on Computing | 2011-10-18 | Paper |
Strategic network formation through peering and service agreements
Games and Economic Behavior | 2011-10-12 | Paper |
Exact and approximate equilibria for optimal group network formation
Theoretical Computer Science | 2011-10-10 | Paper |
Near-optimal network design with selfish agents
Theory of Computing | 2011-05-24 | Paper |
Strategic multiway cut and multicut games
Approximation and Online Algorithms | 2011-02-15 | Paper |
Partition Equilibrium Always Exists in Resource Selection Games
Algorithmic Game Theory | 2010-10-19 | Paper |
Contribution Games in Social Networks
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Stability of load balancing algorithms in dynamic adversarial systems
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Approximation algorithms for the firefighter problem: cuts over time and submodularity
Algorithms and Computation | 2009-12-17 | Paper |
Price of Stability in Survivable Network Design
Algorithmic Game Theory | 2009-12-01 | Paper |
Equilibria in dynamic selfish routing
Algorithmic Game Theory | 2009-12-01 | Paper |
Anarchy, stability, and utopia: creating better matchings
Algorithmic Game Theory | 2009-12-01 | Paper |
Exact and Approximate Equilibria for Optimal Group Network Formation
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing | 2009-08-20 | Paper |
| scientific article; zbMATH DE number 5485474 (Why is no real title available?) | 2009-01-05 | Paper |
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems
SIAM Journal on Computing | 2008-10-28 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
