Piotr Krysta

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 23

Top Topics

Resource Allocation

Combinatorial Auctions

Hypervolume Indicator

Winner Determination

Top Venues

J. Artif. Intell. Res.

Publications

Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
Power of Posted-price Mechanisms for Prophet Inequalities. SODA (2024)
Pedro Braga, Georgios Chionas, Piotr Krysta, Stefanos Leonardos, Georgios Piliouras, Carmine Ventre
Who gets the Maximal Extractable Value? A Dynamic Sharing Blockchain Mechanism. AAMAS (2024)
Pedro Braga, Georgios Chionas, Stefanos Leonardos, Piotr Krysta, Georgios Piliouras, Carmine Ventre
On the Redistribution of Maximal Extractable Value: A Dynamic Mechanism. CoRR (2024)
Vladimir V. Gusev, Duncan Adamson, Argyrios Deligkas, Dmytro Antypov, Christopher M. Collins, Piotr Krysta, Igor Potapov, George R. Darling, Matthew S. Dyer, Paul G. Spirakis, Matthew J. Rosseinsky
Optimality guarantees for crystal structure prediction. Nat. 619 (7968) (2023)
Antonia Tsili, Matthew Dyer, Vladimir Gusev, Piotr Krysta, Rahul Savani
First Order Methods for Geometric Optimization of Crystal Structures. CoRR (2023)
Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta
Adversarial Contention Resolution Games. IJCAI (2023)
Georgios Chionas, Dariusz R. Kowalski, Piotr Krysta
Combinatorial Group Testing with Selfish Agents. NeurIPS (2023)
Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
Optimal Algorithms for Free Order Multiple-Choice Secretary. CoRR (2022)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
Efficient Truthful Scheduling and Resource Allocation through Monitoring. AAAI (2021)
Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski
Entropy-Based Approximation of the Secretary Problem. CoRR (2021)
Piotr Krysta, Mathieu Mari, Nan Zhi
Ultimate greedy approximation of independent sets in subcubic graphs. CoRR (2020)
Piotr Krysta, Mathieu Mari, Nan Zhi
Ultimate greedy approximation of independent sets in subcubic graphs. SODA (2020)
Dariusz R. Kowalski, Piotr Krysta
Deterministic coloring algorithms in the LOCAL model. CoRR (2019)
Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
Size Versus Truthfulness in the House Allocation Problem. Algorithmica 81 (9) (2019)
Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
Network Pollution Games. Algorithmica 81 (1) (2019)
Nan Zhi, Terry R. Payne, Piotr Krysta, Minming Li
Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection. ISWC (1) (2019)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
The Power of Verification for Greedy Mechanism Design. J. Artif. Intell. Res. 62 (2018)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
Combinatorial Auctions Without Money. Algorithmica 77 (3) (2017)
Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis
Learning Powers of Poisson Binomial Distributions. CoRR (2017)
Piotr Krysta, Minming Li, Terry R. Payne, Nan Zhi
Mechanism Design for Ontology Alignment. AAMAS (2017)
Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
New Results for Network Pollution Games. COCOON (2016)
Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
Network Pollution Games. AAMAS (2016)
Piotr Krysta, Jinshan Zhang
House Markets with Matroid and Knapsack Constraints. ICALP (2016)
Piotr Krysta, Orestis Telelis, Carmine Ventre
Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. J. Artif. Intell. Res. 53 (2015)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
The Power of Verification for Greedy Mechanism Design. AAMAS (2015)
Piotr Krysta, Orestis Telelis, Carmine Ventre
Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. IJCAI (2015)
Piotr Krysta, Carmine Ventre
Combinatorial auctions with verification are tractable. Theor. Comput. Sci. 571 (2015)
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. 43 (4) (2014)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
Combinatorial auctions without money. AAMAS (2014)
Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
Size versus truthfulness in the house allocation problem. EC (2014)
Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang
Size versus truthfulness in the House Allocation problem. CoRR (2014)
Piotr Krysta, Orestis Telelis, Carmine Ventre
Mechanisms for multi-unit combinatorial auctions with a few distinct goods. AAMAS (2013)
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
Ranking Games that have Competitiveness-based Strategies CoRR (2013)
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476 (2013)
Dimitris Fotakis, Piotr Krysta, Carmine Ventre
Combinatorial Auctions without Money. CoRR (2013)
Piotr Krysta, Berthold Vöcking
Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) (2012)
Patrick Briest, Martin Hoefer, Piotr Krysta
Stackelberg Network Pricing Games. Algorithmica 62 (3-4) (2012)
Piotr Krysta, Orestis Telelis
Limited Supply Online Auctions for Revenue Maximization. WINE (2012)
Patrick Briest, Piotr Krysta
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. 40 (6) (2011)
Patrick Briest, Piotr Krysta, Berthold Vöcking
Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40 (6) (2011)
Dimitris Fotakis, Piotr Krysta, Orestis Telelis
Externalities among Advertisers in Sponsored Search. SAGT (2011)
Piotr Krysta, Carmine Ventre
Combinatorial Auctions with Verification Are Tractable. ESA (2) (2010)
Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael J. Wooldridge
Combinatorial auctions with externalities. AAMAS (2010)
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
Utilitarian Mechanism Design for Multi-Objective Optimization. SODA (2010)
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre
Ranking games that have competitiveness-based strategies. EC (2010)
Artur Czumaj, Piotr Krysta, Berthold Vöcking
Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39 (5) (2010)
Patrick Briest, Martin Hoefer, Piotr Krysta
Stackelberg Network Pricing Games CoRR (2008)
Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz
Social Context Games. WINE (2008)
Moshe Babaioff, Patrick Briest, Piotr Krysta
On the Approximability of Combinatorial Exchange Problems. SAGT (2008)
Patrick Briest, Martin Hoefer, Piotr Krysta
Stackelberg Network Pricing Games. STACS (2008)
Patrick Briest, Martin Hoefer, Piotr Krysta
Stackelberg Network Pricing Games. Electron. Colloquium Comput. Complex. 14 (101) (2007)
Patrick Briest, Piotr Krysta
Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA (2007)
Piotr Krysta, Krzysztof Lorys
Efficient approximation algorithms for the achromatic number. Theor. Comput. Sci. 361 (2-3) (2006)
Patrick Briest, Piotr Krysta
Single-minded unlimited supply pricing on sparse instances. SODA (2006)
Jörg Knoche, Piotr Krysta
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. WAOA (2006)
Patrick Briest, Piotr Krysta
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. Electron. Colloquium Comput. Complex. 13 (068) (2006)
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
Computing equilibria for a service provider game with (Im)perfect information. ACM Trans. Algorithms 2 (4) (2006)
Patrick Briest, Piotr Krysta, Berthold Vöcking
Approximation techniques for utilitarian mechanism design. STOC (2005)
Piotr Krysta
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. MFCS (2005)
Piotr Krysta
Bicriteria Network Design via Iterative Rounding. COCOON (2005)
Martin Hoefer, Piotr Krysta
Geometric Network Design with Selfish Agents. COCOON (2005)
René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
Computing equilibria for congestion games with (im)perfect information. SODA (2004)
Piotr Krysta, Peter Sanders, Berthold Vöcking
Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS (2003)
Piotr Berman, Piotr Krysta
Optimizing misdirection. SODA (2003)
Piotr Krysta
Approximating minimum size {1, 2}-connected network. Discret. Appl. Math. 125 (2-3) (2003)
Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vöcking
-Splittable Scheduling for DNS-Based Traffic Allocation. Euro-Par (2003)
Artur Czumaj, Piotr Krysta, Berthold Vöcking
Selfish traffic allocation for server farms. STOC (2002)
Béla Csaba, Marek Karpinski, Piotr Krysta
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA (2002)
Piotr Krysta, Roberto Solis-Oba
Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5 (2) (2001)
Piotr Krysta, V. S. Anil Kumar
Approximation Algorithms for Minimum Size 2-Connectivity Problems. STACS (2001)
Piotr Krysta, Krzysztof Lorys
Efficient Approximation Algorithms for the Achromatic Number. ESA (1999)
Piotr Krysta, Roberto Solis-Oba
Approximation Algorithms for Bounded Facility Location. COCOON (1999)
Piotr Krysta, Leszek Pacholski
The STO problem is NP-complete. J. Symb. Comput. 27 (2) (1999)
Leszek Gasieniec, Piotr Indyk, Piotr Krysta
External Inverse Pattern Matching. CPM (1997)