Fair Shares: Feasibility, Domination and Incentives

no code implementations • 16 May 2022 • Moshe Babaioff, Uriel Feige

For additive valuations we present shares that are feasible, self-maximizing and polynomial-time computable.

Best-of-Both-Worlds Fair-Share Allocations

no code implementations • 9 Feb 2021 • Moshe Babaioff, Tomer Ezra, Uriel Feige

The up to one item paradigm fails to give such a guarantee, and it is not difficult to present examples in which previous BoBW mechanisms give agents only a $\frac{1}{n}$ fraction of their MMS.

Fairness Computer Science and Game Theory

Chasing Ghosts: Competing with Stateful Policies

no code implementations • 29 Jul 2014 • Uriel Feige, Tomer Koren, Moshe Tennenholtz

We consider sequential decision making in a setting where regret is measured with respect to a set of stateful reference policies, and feedback is limited to observing the rewards of the actions performed (the so called "bandit" setting).

Attribute Decision Making +1

Why are images smooth?

no code implementations • 19 Jun 2014 • Uriel Feige

We provide quantitative bounds on the smoothness of a typical image in our model, as a function of the number of available scales.