معرفی
Professor Piotr Krysta is a faculty member in the Department of Computer Science, affiliated with the research groups on Algorithms, Complexity Theory and Optimisation, and Economics and Computation. His work spans theoretical and applied domains in algorithmic design and economic systems.
- University of Liverpool (implied by context, though not explicitly stated)
His research interests include:
- Approximation Algorithms
- Combinatorial Optimization
- Algorithmic Game Theory
- Computational Complexity
- Optimization in Network and Economic Systems
His recent publications focus on blockchain mechanisms, combinatorial constraints in delegation, and optimization techniques in graph theory. Funded by UK and German research councils, his work bridges computational hardness with economic applications.
Scientific awards include:
- Best paper award for Track C of 39th ICALP (2012)
- Emmy Noether Fellow (DFG, 2004–2008)
He has served on program committees for major conferences, collaborated internationally, and contributed to journals like Electronic Commerce Research and Applications. His teaching involves supervising theses on algorithmic challenges and mechanism design.
