no code implementations • 14 Oct 2020 • Amitay Dror, Michal Feldman, Erel Segal Halevi
Among other results, we devise polynomial-time algorithms for finding EF1 allocations in the following settings: (i) $n$ agents with heterogeneous partition matroids and heterogeneous binary valuations, (ii) 2 agents with heterogeneous partition matroids and heterogeneous additive valuations, and (iii) at most 3 agents with heterogeneous binary valuations and identical base-orderable matroid constraints.
Computer Science and Game Theory
no code implementations • NeurIPS 2016 • Michal Feldman, Tomer Koren, Roi Livni, Yishay Mansour, Aviv Zohar
We consider a seller with an unlimited supply of a single good, who is faced with a stream of $T$ buyers.
no code implementations • 18 Dec 2015 • Michal Feldman, Amos Fiat, Iddan Golomb
We study mechanisms for candidate selection that seek to minimize the social cost, where voters and candidates are associated with points in some underlying metric space.
