activity
20082024
most citedSize versus truthfulness in the House Allocation problem

12 citations · 26 across the 9 of their papers we have counts for

collaborators

11 papers

cs.GT2024

MEV Sharing with Dynamic Extraction Rates

Pedro Braga, Georgios Chionas, Piotr Krysta +3

Maximal Extractable Value (MEV) has emerged as a new frontier in the design of blockchain systems. In this paper, we propose making the MEV extraction rate as part of the protocol…

math.OC2023

First Order Methods for Geometric Optimization of Crystal Structures

Antonia Tsili, Matthew Dyer, Vladimir Gusev +2

The geometric optimization of crystal structures is a procedure widely used in Chemistry that changes the geometrical placement of the particles inside a structure. It is called st…

cs.DS2022★ 1 cited

Optimal Algorithms for Free Order Multiple-Choice Secretary

Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta +1

Suppose we are given integer and boxes labeled by an adversary, each containing a number chosen from an unknown distribution. We have to choose an orde…

cs.DS2021

Online Sampling and Decision Making with Low Entropy

Mohammad Taghi Hajiaghayi, Dariusz R. Kowalski, Piotr Krysta +1

Consider the problem: we are given boxes, labeled by an adversary, each containing a single number chosen from an unknown distribution; these distributi…

cs.DS2020

Ultimate greedy approximation of independent sets in subcubic graphs

Piotr Krysta, Mathieu Mari, Nan Zhi

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization pro…

cs.DS2019★ 2 cited

Deterministic coloring algorithms in the LOCAL model

Dariusz R. Kowalski, Piotr Krysta

We study the problem of bi-chromatic coloring of hypergraphs in the LOCAL distributed model of computation. This problem can easily be solved by a randomized local algorithm with n…