ACGO

Computing buyer-optimal Walrasian prices in multi-unit matching markets via a sequence of max flow computations.

The AGM Bound.

Searching infected nodes in uncertain graphs.

Machine Covering in the Random-Order Model.

Semi-random process.

Efficiency and fairness in random resource allocation and social choice.

Semi-random process.

Percolation on dense random graphs with given degrees.

A PTAS for Unsplittable Flow on a Path.

How to split the costs and charge the travellers sharing a ride? aligning system’s optimum with users’ equilibrium.