| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Journal article
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre.
Ranking Games that have Competitiveness-based Strategies
|
CoRR 2013, Volume 0 |
 (0)
|
2013 |
|
|
Journal article
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre.
Ranking games that have competitiveness-based strategies.
|
Theor. Comput. Sci. 2013, Volume 476 |
(0)
|
2013 |
|
|
Conference paper
Patrick Briest, Martin Hoefer, Piotr Krysta.
Stackelberg Network Pricing Games.
|
Algorithmica 2012, Volume 62 |
(0)
|
2012 |
|
|
Conference paper
Piotr Krysta, Berthold Vöcking.
Online Mechanism Design (Randomized Rounding on the Fly).
|
Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II 2012 |
(0)
|
2012 |
|
|
Conference paper
Piotr Krysta, Orestis Telelis.
Limited Supply Online Auctions for Revenue Maximization.
|
Internet and Network Economics - 8th International Workshop, WINE 2012, Liverpool, UK, December 10-12, 2012. Proceedings 2012 |
(0)
|
2012 |
|
|
Conference paper
Dimitris Fotakis, Piotr Krysta, Orestis Telelis.
Externalities among Advertisers in Sponsored Search.
|
Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings 2011 |
(0)
|
2011 |
|
|
Conference paper
Patrick Briest, Piotr Krysta, Berthold Vöcking.
Approximation Techniques for Utilitarian Mechanism Design.
|
SIAM J. Comput. 2011, Volume 40 |
(0)
|
2011 |
|
|
Conference paper
Patrick Briest, Piotr Krysta.
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.
|
SIAM J. Comput. 2011, Volume 40 |
(0)
|
2011 |
|
|
Conference paper
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre.
Ranking games that have competitiveness-based strategies.
|
Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010 2010 |
(0)
|
2010 |
|
|
Conference paper
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre.
Utilitarian Mechanism Design for Multi-Objective Optimization.
|
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010 2010 |
(0)
|
2010 |
|
|
Conference paper
Piotr Krysta, Carmine Ventre.
Combinatorial Auctions with Verification Are Tractable.
|
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II 2010 |
(0)
|
2010 |
|
|
Conference paper
Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael Wooldridge.
Combinatorial auctions with externalities.
|
|
(0)
|
2010 |
|
|
Conference paper
Artur Czumaj, Piotr Krysta, Berthold Vöcking.
Selfish Traffic Allocation for Server Farms.
|
SIAM J. Comput. 2009, Volume 39 |
(0)
|
2010 |
|
|
Conference paper
Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz.
Social Context Games.
|
Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Moshe Babaioff, Patrick Briest, Piotr Krysta.
On the Approximability of Combinatorial Exchange Problems.
|
Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Patrick Briest, Martin Hoefer, Piotr Krysta.
Stackelberg Network Pricing Games
|
CoRR 2008, Volume 0 |
(0)
|
2008 |
|
|
Book chapter
Piotr Krysta, Berthold Vöcking.
Utilitarian Mechanism Design for Single-Minded Agents.
|
Encyclopedia of Algorithms 2008 |
(0)
|
2008 |
|
|
Conference paper
Patrick Briest, Martin Hoefer, Piotr Krysta.
Stackelberg Network Pricing Games.
|
STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings 2008 |
(0)
|
2008 |
|
|
Conference paper
Patrick Briest, Piotr Krysta.
Buying cheap is expensive: hardness of non-parametric multi-product pricing.
|
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007 2007 |
(0)
|
2007 |
|
|
Conference paper
Patrick Briest, Martin Hoefer, Piotr Krysta.
Stackelberg Network Pricing Games.
|
Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14 |
(0)
|
2007 |
|
|
Conference paper
Patrick Briest, Piotr Krysta.
Single-minded unlimited supply pricing on sparse instances.
|
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006 2006 |
(0)
|
2006 |
|
|
Conference paper
Jörg Knoche, Piotr Krysta.
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
|
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers 2006 |
(0)
|
2006 |
|
|
Conference paper
Patrick Briest, Piotr Krysta.
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing.
|
Electronic Colloquium on Computational Complexity (ECCC) 2006, Volume null |
(0)
|
2006 |
|
|
Conference paper
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking.
Computing equilibria for a service provider game with (Im)perfect information.
|
ACM Transactions on Algorithms 2006, Volume 2 |
(0)
|
2006 |
|
|
Conference paper
Piotr Krysta, Krzysztof Lorys.
Efficient approximation algorithms for the achromatic number.
|
Theor. Comput. Sci. 2006, Volume 361 |
(0)
|
2006 |
|
|
Conference paper
Martin Hoefer, Piotr Krysta.
Geometric Network Design with Selfish Agents.
|
Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 2005 |
(0)
|
2005 |
|
|
Conference paper
Piotr Krysta.
Bicriteria Network Design via Iterative Rounding.
|
Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 2005 |
(0)
|
2005 |
|
|
Conference paper
Piotr Krysta.
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing.
|
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings 2005 |
(0)
|
2005 |
|
|
Conference paper
Patrick Briest, Piotr Krysta, Berthold Vöcking.
Approximation techniques for utilitarian mechanism design.
|
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005 2005 |
(0)
|
2005 |
|
|
Conference paper
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking.
Computing equilibria for congestion games with (im)perfect information.
|
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 2004 |
(0)
|
2004 |
|
|
Conference paper
Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vöcking.
An Experimental Study of
|
Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings 2003 |
(0)
|
2003 |
|
|
Conference paper
Piotr Krysta, Peter Sanders, Berthold Vöcking.
Scheduling and Traffic Allocation for Tasks with Bounded Splittability.
|
Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003 |
(0)
|
2003 |
|
|
Conference paper
Piotr Berman, Piotr Krysta.
Optimizing misdirection.
|
SODA 2003 |
(0)
|
2003 |
|
|
Conference paper
Piotr Krysta.
Approximating minimum size {1, 2}-connected network.
|
Discrete Applied Mathematics 2003, Volume 125 |
(0)
|
2003 |
|
|
Conference paper
Béla Csaba, Marek Karpinski, Piotr Krysta.
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
|
SODA 2002 |
(0)
|
2002 |
|
|
Conference paper
Artur Czumaj, Piotr Krysta, Berthold Vöcking.
Selfish traffic allocation for server farms.
|
STOC 2002 |
(0)
|
2002 |
|
|
Conference paper
Piotr Krysta, V. S. Anil Kumar.
Approximation Algorithms for Minimum Size 2-Connectivity Problems.
|
STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings 2001 |
(0)
|
2001 |
|
|
Conference paper
Piotr Krysta, Roberto Solis-Oba.
Approximation Algorithms for Bounded Facility Location Problems.
|
J. Comb. Optim. 2001, Volume 5 |
(0)
|
2001 |
|
|
Conference paper
Piotr Krysta, Roberto Solis-Oba.
Approximation Algorithms for Bounded Facility Location.
|
COCOON 1999 |
(0)
|
1999 |
|
|
Conference paper
Piotr Krysta, Krzysztof Lorys.
Efficient Approximation Algorithms for the Achromatic Number.
|
Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings 1999 |
(0)
|
1999 |
|
|
Conference paper
Piotr Krysta, Leszek Pacholski.
The STO problem is NP-complete.
|
J. Symb. Comput. 1999, Volume 27 |
(0)
|
1999 |
|
|
Conference paper
Leszek Gasieniec, Piotr Indyk, Piotr Krysta.
External Inverse Pattern Matching.
|
Combinatorial Pattern Matching, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings 1997 |
(0)
|
1997 |
k/PiotrKrysta