We study the prophet inequality when the gambler has an access only to a...
Online markets are a part of everyday life, and their rules are governed...
Finding a stable matching is one of the central problems in algorithmic ...
Finding a stable matching is one of the central problems in algorithmic ...
A simple game (N,v) is given by a set N of n players and a partition
of ...
We provide an algorithm for computing the nucleolus for an instance of a...
The stable matching problem is one of the central problems of algorithmi...
We consider the three-dimensional stable matching problem with cyclic
pr...
We prove an upper bound of the form 2^O(d^2 polylog d) on the
number of ...
In this note, we show that for every simple game with n players the crit...
The classical stable marriage problem asks for a matching between a set ...
We provide an efficient algorithm for computing the nucleolus for an ins...