default search action
Piotr Krysta
Person information
- affiliation: Augusta University, GA, USA
- affiliation: University of Liverpool, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Piotr Krysta, Mathieu Mari
, Nan Zhi:
Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs. Algorithmica 86(11): 3518-3578 (2024) - [c45]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: 2171-2173 - [c44]Pedro Braga, Georgios Chionas, Piotr Krysta, Stefanos Leonardos, Georgios Piliouras, Carmine Ventre:
MEV Sharing with Dynamic Extraction Rates. DeFi@CCS 2024: 1-10 - [c43]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Online Sampling and Decision Making with Low Entropy. IJCAI 2024: 4080-4088 - [c42]Kiarash Banihashem, MohammadTaghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Power of Posted-price Mechanisms for Prophet Inequalities. SODA 2024: 4580-4604 - [i13]Pedro Braga, Georgios Chionas, Stefanos Leonardos, Piotr Krysta, Georgios Piliouras, Carmine Ventre:
On the Redistribution of Maximal Extractable Value: A Dynamic Mechanism. CoRR abs/2402.15849 (2024) - 2023
- [j18]Vladimir V. Gusev
Optimality guarantees for crystal structure prediction. Nat. 619(7968): 68-72 (2023) - [c41]Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta:
Adversarial Contention Resolution Games. IJCAI 2023: 2598-2606 - [c40]Georgios Chionas, Dariusz R. Kowalski, Piotr Krysta:
Combinatorial Group Testing with Selfish Agents. NeurIPS 2023 - [i12]Antonia Tsili, Matthew S. Dyer, Vladimir V. Gusev, Piotr Krysta, Rahul Savani
First Order Methods for Geometric Optimization of Crystal Structures. CoRR abs/2301.12941 (2023) - 2022
- [i11]Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Optimal Algorithms for Free Order Multiple-Choice Secretary. CoRR abs/2207.10703 (2022) - 2021
- [c39]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Efficient Truthful Scheduling and Resource Allocation through Monitoring. AAAI 2021: 5423-5431 - [i10]Dariusz R. Kowalski, Piotr Krysta, Jan Olkowski:
Entropy-Based Approximation of the Secretary Problem. CoRR abs/2111.13203 (2021) - 2020
- [c38]Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate greedy approximation of independent sets in subcubic graphs. SODA 2020: 1436-1455 - [i9]Piotr Krysta, Mathieu Mari, Nan Zhi:
Ultimate greedy approximation of independent sets in subcubic graphs. CoRR abs/2001.11997 (2020)
2010 – 2019
- 2019
- [j17]Eleftherios Anastasiadis, Xiaotie Deng
Network Pollution Games. Algorithmica 81(1): 124-166 (2019) - [j16]Piotr Krysta, David F. Manlove
Size Versus Truthfulness in the House Allocation Problem. Algorithmica 81(9): 3422-3463 (2019) - [c37]Nan Zhi, Terry R. Payne
Truthful Mechanisms for Multi Agent Self-interested Correspondence Selection. ISWC (1) 2019: 733-750 - [i8]Dariusz R. Kowalski, Piotr Krysta:
Deterministic coloring algorithms in the LOCAL model. CoRR abs/1907.12857 (2019) - 2018
- [j15]Dimitris Fotakis, Piotr Krysta, Carmine Ventre
The Power of Verification for Greedy Mechanism Design. J. Artif. Intell. Res. 62: 459-488 (2018) - 2017
- [j14]Dimitris Fotakis, Piotr Krysta, Carmine Ventre
Combinatorial Auctions Without Money. Algorithmica 77(3): 756-785 (2017) - [c36]Piotr Krysta, Minming Li, Terry R. Payne, Nan Zhi:
Mechanism Design for Ontology Alignment. AAMAS 2017: 1587-1588 - [i7]Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta, Paul G. Spirakis:
Learning Powers of Poisson Binomial Distributions. CoRR abs/1707.05662 (2017) - 2016
- [c35]Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang:
Network Pollution Games. AAMAS 2016: 23-31 - [c34]Eleftherios Anastasiadis, Xiaotie Deng
New Results for Network Pollution Games. COCOON 2016: 39-51 - [c33]Piotr Krysta, Jinshan Zhang:
House Markets with Matroid and Knapsack Constraints. ICALP 2016: 141:1-141:14 - [r2]Piotr Krysta, Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2016: 2312-2318 - 2015
- [j13]Piotr Krysta, Orestis Telelis, Carmine Ventre
Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods. J. Artif. Intell. Res. 53: 721-744 (2015) - [j12]Piotr Krysta, Carmine Ventre
Combinatorial auctions with verification are tractable. Theor. Comput. Sci. 571: 21-35 (2015) - [c32]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
The Power of Verification for Greedy Mechanism Design. AAMAS 2015: 307-315 - [c31]Piotr Krysta, Orestis Telelis, Carmine Ventre:
Near-Optimal Approximation Mechanisms for Multi-Unit Combinatorial Auctions. IJCAI 2015: 4275-4281 - 2014
- [j11]Fabrizio Grandoni
Utilitarian Mechanism Design for Multiobjective Optimization. SIAM J. Comput. 43(4): 1263-1290 (2014) - [c30]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial auctions without money. AAMAS 2014: 1029-1036 - [c29]Piotr Krysta, David F. Manlove
Size versus truthfulness in the house allocation problem. EC 2014: 453-470 - [i6]Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang:
Size versus truthfulness in the House Allocation problem. CoRR abs/1404.5245 (2014) - 2013
- [j10]Leslie Ann Goldberg, Paul W. Goldberg
Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476: 24-37 (2013) - [c28]Piotr Krysta, Orestis Telelis, Carmine Ventre:
Mechanisms for multi-unit combinatorial auctions with a few distinct goods. AAMAS 2013: 691-698 - [i5]Leslie Ann Goldberg, Paul W. Goldberg, Piotr Krysta, Carmine Ventre:
Ranking Games that have Competitiveness-based Strategies. CoRR abs/1301.5844 (2013) - [i4]Dimitris Fotakis, Piotr Krysta, Carmine Ventre:
Combinatorial Auctions without Money. CoRR abs/1310.0177 (2013) - 2012
- [j9]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. Algorithmica 62(3-4): 733-753 (2012) - [c27]Piotr Krysta, Berthold Vöcking:
Online Mechanism Design (Randomized Rounding on the Fly). ICALP (2) 2012: 636-647 - [c26]Piotr Krysta, Orestis Telelis:
Limited Supply Online Auctions for Revenue Maximization. WINE 2012: 519-525 - 2011
- [j8]Patrick Briest, Piotr Krysta:
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM J. Comput. 40(6): 1554-1586 (2011) - [j7]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation Techniques for Utilitarian Mechanism Design. SIAM J. Comput. 40(6): 1587-1622 (2011) - [c25]Dimitris Fotakis
Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 - 2010
- [j6]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish Traffic Allocation for Server Farms. SIAM J. Comput. 39(5): 1957-1987 (2010) - [c24]Piotr Krysta, Tomasz P. Michalak, Tuomas Sandholm, Michael J. Wooldridge:
Combinatorial auctions with externalities. AAMAS 2010: 1471-1472 - [c23]Piotr Krysta, Carmine Ventre
Combinatorial Auctions with Verification Are Tractable. ESA (2) 2010: 39-50 - [c22]Leslie Ann Goldberg, Paul W. Goldberg
Ranking games that have competitiveness-based strategies. EC 2010: 335-344 - [c21]Fabrizio Grandoni
Utilitarian Mechanism Design for Multi-Objective Optimization. SODA 2010: 573-584
2000 – 2009
- 2008
- [c20]Moshe Babaioff, Patrick Briest, Piotr Krysta:
On the Approximability of Combinatorial Exchange Problems. SAGT 2008: 83-94 - [c19]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. STACS 2008: 133-142 - [c18]Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz:
Social Context Games. WINE 2008: 675-683 - [r1]Piotr Krysta, Berthold Vöcking:
Utilitarian Mechanism Design for Single-Minded Agents. Encyclopedia of Algorithms 2008 - [i3]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. CoRR abs/0802.2841 (2008) - 2007
- [c17]Patrick Briest, Piotr Krysta:
Buying cheap is expensive: hardness of non-parametric multi-product pricing. SODA 2007: 716-725 - [i2]Patrick Briest, Martin Hoefer, Piotr Krysta:
Stackelberg Network Pricing Games. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j5]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): 679-706 (2006) - [j4]Piotr Krysta, Krzysztof Lorys:
Efficient approximation algorithms for the achromatic number. Theor. Comput. Sci. 361(2-3): 150-171 (2006) - [c16]Patrick Briest, Piotr Krysta:
Single-minded unlimited supply pricing on sparse instances. SODA 2006: 1093-1102 - [c15]Jörg Knoche
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. WAOA 2006: 265-278 - [i1]Patrick Briest, Piotr Krysta:
Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c14]Martin Hoefer, Piotr Krysta:
Geometric Network Design with Selfish Agents. COCOON 2005: 167-178 - [c13]Piotr Krysta:
Bicriteria Network Design via Iterative Rounding. COCOON 2005: 179-187 - [c12]Piotr Krysta:
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing. MFCS 2005: 615-627 - [c11]Patrick Briest, Piotr Krysta, Berthold Vöcking:
Approximation techniques for utilitarian mechanism design. STOC 2005: 39-48 - 2004
- [c10]René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Computing equilibria for congestion games with (im)perfect information. SODA 2004: 746-755 - 2003
- [j3]Piotr Krysta:
Approximating minimum size {1, 2}-connected network. Discret. Appl. Math. 125(2-3): 267-288 (2003) - [c9]Amit Agarwal, Tarun Agarwal, Sumit Chopra
An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation. Euro-Par 2003: 230-235 - [c8]Piotr Krysta, Peter Sanders, Berthold Vöcking:
Scheduling and Traffic Allocation for Tasks with Bounded Splittability. MFCS 2003: 500-510 - [c7]Piotr Berman, Piotr Krysta:
Optimizing misdirection. SODA 2003: 192-201 - 2002
- [c6]Béla Csaba, Marek Karpinski, Piotr Krysta:
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA 2002: 74-83 - [c5]Artur Czumaj, Piotr Krysta, Berthold Vöcking:
Selfish traffic allocation for server farms. STOC 2002: 287-296 - 2001
- [b1]Piotr Krysta:
Approximation algorithms for combinatorial optimization problems in graph coloring and network desig. Saarland University, Germany, 2001 - [j2]Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location Problems. J. Comb. Optim. 5(2): 233-247 (2001) - [c4]Piotr Krysta, V. S. Anil Kumar:
Approximation Algorithms for Minimum Size 2-Connectivity Problems. STACS 2001: 431-442
1990 – 1999
- 1999
- [j1]Piotr Krysta, Leszek Pacholski:
The STO problem is NP-complete. J. Symb. Comput. 27(2): 207-219 (1999) - [c3]Piotr Krysta, Roberto Solis-Oba:
Approximation Algorithms for Bounded Facility Location. COCOON 1999: 241-250 - [c2]Piotr Krysta, Krzysztof Lorys:
Efficient Approximation Algorithms for the Achromatic Number. ESA 1999: 402-413 - 1997
- [c1]Leszek Gasieniec, Piotr Indyk, Piotr Krysta:
External Inverse Pattern Matching. CPM 1997: 90-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-21 20:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: