12 citations · 26 across the 9 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…
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…
Learning Powers of Poisson Binomial Distributions
Dimitris Fotakis, Vasilis Kontonis, Piotr Krysta +1
We introduce the problem of simultaneously learning all powers of a Poisson Binomial Distribution (PBD). A PBD of order is the distribution of a sum of mutually independent…
Stackelberg Network Pricing Games
Patrick Briest, Martin Hoefer, Piotr Krysta
We study a multi-player one-round game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of priceable edges in a graph. The other edges hav…