We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...