| Approximation techniques for utilitarian mechanism design P Briest, P Krysta, B Vöcking Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 203 | 2005 |
| Selfish traffic allocation for server farms A Czumaj, P Krysta, B Vöcking Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 143 | 2002 |
| Single-minded unlimited supply pricing on sparse instances P Briest, P Krysta Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 127 | 2006 |
| Stackelberg network pricing games P Briest, M Hoefer, P Krysta Algorithmica 62 (3), 733-753, 2012 | 72 | 2012 |
| Size versus truthfulness in the house allocation problem P Krysta, D Manlove, B Rastegari, J Zhang Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 71 | 2014 |
| Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems B Csaba, M Karpinski, P Krysta Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002 | 63 | 2002 |
| Social context games I Ashlagi, P Krysta, M Tennenholtz International Workshop on Internet and Network Economics, 675-683, 2008 | 55 | 2008 |
| Buying cheap is expensive: Hardness of non-parametric multi-product pricing P Briest, P Krysta SODA 7, 716-725, 2007 | 53 | 2007 |
| Online mechanism design (randomized rounding on the fly) P Krysta, B Vöcking International Colloquium on Automata, Languages, and Programming, 636-647, 2012 | 51 | 2012 |
| Approximation techniques for utilitarian mechanism design P Briest, P Krysta, B Vöcking SIAM Journal on Computing 40 (6), 1587-1622, 2011 | 49 | 2011 |
| Mechanisms for multi-unit combinatorial auctions with a few distinct goods P Krysta, O Telelis, C Ventre Journal of Artificial Intelligence Research 53, 721-744, 2015 | 44 | 2015 |
| Approximation algorithms for minimum size 2-connectivity problems P Krysta, VSA Kumar Annual Symposium on Theoretical Aspects of Computer Science, 431-442, 2001 | 35 | 2001 |
| Externalities among advertisers in sponsored search D Fotakis, P Krysta, O Telelis International Symposium on Algorithmic Game Theory, 105-116, 2011 | 34 | 2011 |
| Greedy approximation via duality for packing, combinatorial auctions and routing P Krysta International Symposium on Mathematical Foundations of Computer Science, 615-627, 2005 | 33 | 2005 |
| Combinatorial auctions with externalities. P Krysta, TP Michalak, T Sandholm, MJ Wooldridge AAMAS 10, 1471-1472, 2010 | 30 | 2010 |
| Computing equilibria for congestion games with (im) perfect information. R Beier, A Czumaj, P Krysta, B Vöcking SODA, 746-755, 2004 | 29 | 2004 |
| Buying cheap is expensive: Approximability of combinatorial pricing problems P Briest, P Krysta SIAM Journal on Computing 40 (6), 1554-1586, 2011 | 24 | 2011 |
| Geometric network design with selfish agents M Hoefer, P Krysta International Computing and Combinatorics Conference, 167-178, 2005 | 24 | 2005 |
| Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023 | 23 | 2023 |
| Combinatorial auctions without money D Fotakis, P Krysta, C Ventre Algorithmica 77, 756-785, 2017 | 23 | 2017 |
