9 citations · 14 across the 4 of their papers we have counts for
4 papers
Pricing Online Decisions: Beyond Auctions
Ilan Reuven Cohen, Alon Eden, Amos Fiat +1
We consider dynamic pricing schemes in online settings where selfish agents generate online events. Previous work on online mechanisms has dealt almost entirely with the goal of ma…
Tight Lower Bounds on Envy-Free Makespan Approximation
Amos Fiat, Ariel Levavi
In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show th…
On the Interplay between Incentive Compatibility and Envy Freeness
Edith Cohen, Michal Feldman, Amos Fiat +2
We study mechanisms for an allocation of goods among agents, where agents have no incentive to lie about their true values (incentive compatible) and for which no agent will seek t…
Truth and Envy in Capacitated Allocation Games
Edith Cohen, Michal Feldman, Amos Fiat +2
We study auctions with additive valuations where agents have a limit on the number of goods they may receive. We refer to such valuations as {\em capacitated} and seek mechanisms t…