Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Cooperative facility location games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Equitable cost allocations via primal-dual-type algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pricing multicasting in more practical network models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Hardness Results for Multicast Cost Sharing
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
On the core of the multicommodity flow game
Proceedings of the 4th ACM conference on Electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
Proceedings of the 4th ACM conference on Electronic commerce
Budget balanced mechanisms for the multicast pricing problem with rates
Proceedings of the 4th ACM conference on Electronic commerce
Profit-maximizing multicast pricing by approximating fixed points [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hardness results for multicast cost sharing
Theoretical Computer Science
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Cross-monotonic cost-sharing methods for connected facility location games
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Sharing the cost of multicast transmissions in wireless networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the expected payment of mechanisms for task allocation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the core of the multicommodity flow game
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Cost sharing in a job scheduling problem using the Shapley value
Proceedings of the 6th ACM conference on Electronic commerce
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost sharing schemes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A group-strategyproof mechanism for Steiner forests
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Non-cooperative multicast and facility location games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Posted price profit maximization for multicast by approximating fixed points
Journal of Algorithms
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 8th ACM conference on Electronic commerce
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost-sharing schemes
ACM Transactions on Algorithms (TALG)
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
A new approach to auctions and resilient mechanism design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms
When ignorance helps: Graphical multicast cost sharing games
Theoretical Computer Science
On achieving group strategyproof information dissemination in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Pseudonyms in Cost-Sharing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the core of the multicommodity flow game
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Non-cooperative facility location and covering games
Theoretical Computer Science
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Cost sharing methods for makespan and completion time scheduling
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pricing tree access networks with connected backbones
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The price of nash equilibria in multicast transmissions games
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A network creation game with nonuniform interests
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Cost sharing and strategyproof mechanisms for set cover games
Journal of Combinatorial Optimization
The cooperative game theory foundations of network bargaining games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Minimal subsidies in expense sharing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Computing α-efficient cost allocations for unbalanced games
SocInfo'10 Proceedings of the Second international conference on Social informatics
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Selfish service installation in networks
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Share the multicast payment fairly
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
What about wednesday? approximation algorithms for multistage stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
More powerful and simpler cost-sharing methods
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Free-riders in steiner tree cost-sharing games
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Research proposal: cooperation among self interested agents
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Networks
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
On budget-balanced group-strategyproof cost-sharing mechanisms
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Cost-recovering bayesian algorithmic mechanism design
Proceedings of the fourteenth ACM conference on Electronic commerce
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
| Hi-index | 0.02 |