Projects per year
Fingerprint
Dive into the research topics where Piotr Jan Krysta is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Algorithms and Mechanisms for Blockchain
Krysta, P. J. (CoI) & Chionas, G. (CoI)
Engineering and Physical Sciences Research Council
9/30/22 → 9/29/26
Project: Research project
-
Efficient Algorithms for Mechanism Design Without Monetary Transfer
Goldberg, P. W. (CoPI), Krysta, P. J. (PI) & Christodoulou, G. G. (CoPI)
Engineering and Physical Sciences Research Council
6/1/13 → 5/31/16
Project: Research project
-
Efficient Decentralised Approaches in Algorithmic Game Theory
Goldberg, P. W. (PI), Goldberg, L. A. (CoPI) & Krysta, P. J. (CoPI)
Engineering and Physical Sciences Research Council
10/1/09 → 12/31/12
Project: Research project
-
Algorithmic Mechanism Design and Optimization Problems with Economic Applications
Krysta, P. J. (PI)
Engineering and Physical Sciences Research Council
4/1/09 → 9/30/12
Project: Research project
-
Algorithmic Tools for Games with Applications to E-Commerce and Networks
Krysta, P. J. (PI)
Deutsche Forschungsgemeinschaft
1/1/04 → 12/31/08
Project: Research project
-
Beating Competitive Ratio 4 for Graphic Matroid Secretary
Banihashem, K., Hajiaghayi, M. T., Kowalski, D. R., Krysta, P., Mittal, D. & Olkowski, J., Oct 1 2025, 33rd Annual European Symposium on Algorithms, ESA 2025. Benoit, A., Kaplan, H., Wild, S., Wild, S. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 351).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
What Is the Minimum Number of Random Bits Required for Computability and Efficiency in Anonymous Networks?
Kowalski, D. R., Krysta, P. & Kutten, S., Sep 15 2025, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025. Ene, A. & Chattopadhyay, E. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 41. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 353).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Delegated Choice with Combinatorial Constraints
Banihashem, K., Hajiaghayi, M. T., Krysta, P. & Shin, S., Jul 2 2025, EC 2025 - Proceedings of the 26th ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 275-303 29 p. (EC 2025 - Proceedings of the 26th ACM Conference on Economics and Computation).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Delegation with Costly Inspection
Hajiaghayi, M. T., Krysta, P., Mahdavi, M. & Shin, S., Jul 2 2025, EC 2025 - Proceedings of the 26th ACM Conference on Economics and Computation. Association for Computing Machinery, Inc, p. 871-894 24 p. (EC 2025 - Proceedings of the 26th ACM Conference on Economics and Computation).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
MEV Sharing with Dynamic Extraction Rates
Braga, P., Chionas, G., Krysta, P., Leonardos, S., Piliouras, G. & Ventre, C., Nov 19 2024, DeFi 2024 - Proceedings of the Workshop on Decentralized Finance and Security, Co-Located with: CCS 2024. Association for Computing Machinery, Inc, p. 1-10 10 p. (DeFi 2024 - Proceedings of the Workshop on Decentralized Finance and Security, Co-Located with: CCS 2024).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access1 Scopus citations