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 | 181 | 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 | 141 | 2002 |

Single-minded unlimited supply pricing on sparse instances P Briest, P Krysta Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 121 | 2006 |

Stackelberg network pricing games P Briest, M Hoefer, P Krysta Algorithmica 62 (3-4), 733-753, 2012 | 59 | 2012 |

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 | 50 | 2002 |

Size versus truthfulness in the house allocation problem P Krysta, D Manlove, B Rastegari, J Zhang Algorithmica 81 (9), 3422-3463, 2019 | 48 | 2019 |

Buying cheap is expensive: Hardness of non-parametric multi-product pricing P Briest, P Krysta SODA 7, 716-725, 2007 | 48 | 2007 |

Social context games I Ashlagi, P Krysta, M Tennenholtz International Workshop on Internet and Network Economics, 675-683, 2008 | 43 | 2008 |

Approximation techniques for utilitarian mechanism design P Briest, P Krysta, B Vöcking SIAM Journal on Computing 40 (6), 1587-1622, 2011 | 42 | 2011 |

Online mechanism design (randomized rounding on the fly) P Krysta, B Vöcking International Colloquium on Automata, Languages, and Programming, 636-647, 2012 | 35 | 2012 |

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 | 34 | 2015 |

Combinatorial Auctions with Externalities: Basic Properties and Bidding Languages P Krysta, T Michalak, T Sandholm, M Wooldridge Proceedings of the 9th International Conference on Autonomous Agents and …, 2010 | 27 | 2010 |

Approximation algorithms for minimum size 2-connectivity problems P Krysta, VSA Kumar Annual Symposium on Theoretical Aspects of Computer Science, 431-442, 2001 | 27 | 2001 |

Greedy approximation via duality for packing, combinatorial auctions and routing P Krysta International Symposium on Mathematical Foundations of Computer Science, 615-627, 2005 | 26 | 2005 |

Externalities among advertisers in sponsored search D Fotakis, P Krysta, O Telelis International Symposium on Algorithmic Game Theory, 105-116, 2011 | 24 | 2011 |

Computing equilibria for congestion games with (im) perfect information R Beier, A Czumaj, P Krysta, B Vöcking Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 24 | 2004 |

Combinatorial auctions without money D Fotakis, P Krysta, C Ventre Algorithmica 77 (3), 756-785, 2017 | 23 | 2017 |

Geometric network design with selfish agents M Hoefer, P Krysta International Computing and Combinatorics Conference, 167-178, 2005 | 22 | 2005 |

Buying cheap is expensive: Approximability of combinatorial pricing problems P Briest, P Krysta SIAM Journal on Computing 40 (6), 1554-1586, 2011 | 21 | 2011 |

Combinatorial auctions with verification are tractable P Krysta, C Ventre European Symposium on Algorithms, 39-50, 2010 | 20 | 2010 |