| Publication | Date of Publication | Type |
|---|
| Power of posted-price mechanisms for prophet inequalities | 2024-11-28 | Paper |
Ultimate greedy approximation of independent sets in subcubic graphs
Algorithmica | 2024-10-24 | Paper |
Ultimate greedy approximation of independent sets in subcubic graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Size versus truthfulness in the house allocation problem
Algorithmica | 2019-08-20 | Paper |
Network pollution games
Algorithmica | 2019-01-11 | Paper |
The power of verification for greedy mechanism design
Journal of Artificial Intelligence Research | 2018-08-14 | Paper |
| House markets with matroid and knapsack constraints | 2017-12-19 | Paper |
Combinatorial auctions without money
Algorithmica | 2017-04-12 | Paper |
New results for network pollution games
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Mechanisms for multi-unit combinatorial auctions with a few distinct goods
Journal of Artificial Intelligence Research | 2015-10-29 | Paper |
Computing equilibria for a service provider game with (Im)perfect information
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Computing equilibria for congestion games with (im)perfect information | 2015-08-03 | Paper |
Combinatorial auctions with verification are tractable
Theoretical Computer Science | 2015-01-30 | Paper |
| Buying cheap is expensive: hardness of non-parametric multi-product pricing | 2014-12-18 | Paper |
Utilitarian mechanism design for multiobjective optimization
SIAM Journal on Computing | 2014-11-14 | Paper |
| scientific article; zbMATH DE number 6297731 (Why is no real title available?) | 2014-05-22 | Paper |
Ranking games that have competitiveness-based strategies
Theoretical Computer Science | 2013-04-17 | Paper |
| Stackelberg network pricing games | 2013-03-19 | Paper |
Online mechanism design (randomized rounding on the fly)
Automata, Languages, and Programming | 2012-11-01 | Paper |
Stackelberg network pricing games
Algorithmica | 2012-04-26 | Paper |
Approximation techniques for utilitarian mechanism design
SIAM Journal on Computing | 2012-03-15 | Paper |
Buying cheap is expensive: approximability of combinatorial pricing problems
SIAM Journal on Computing | 2012-03-15 | Paper |
Externalities among Advertisers in Sponsored Search
Algorithmic Game Theory | 2011-10-28 | Paper |
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing | 2010-11-04 | Paper |
Combinatorial Auctions with Verification Are Tractable
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Single-minded unlimited supply pricing on sparse instances
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Selfish traffic allocation for server farms
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
On the Approximability of Combinatorial Exchange Problems
Algorithmic Game Theory | 2008-05-02 | Paper |
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions
Approximation and Online Algorithms | 2008-02-21 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science | 2006-09-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
| scientific article; zbMATH DE number 2119646 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079339 (Why is no real title available?) | 2004-07-28 | Paper |
Approximating minimum size \{1,2\}-connected networks
Discrete Applied Mathematics | 2003-03-09 | Paper |
| scientific article; zbMATH DE number 1688381 (Why is no real title available?) | 2002-01-09 | Paper |
Approximation algorithms for bounded facility location problems
Journal of Combinatorial Optimization | 2001-09-19 | Paper |
The STO problem is NP-complete
Journal of Symbolic Computation | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1405798 (Why is no real title available?) | 2000-03-27 | Paper |
