3 citations · 8 across the 14 of their papers we have counts for
4 papers · 1 filter
Interdependent Values without Single-Crossing
Alon Eden, Michal Feldman, Amos Fiat +1
We consider a setting where an auctioneer sells a single item to potential agents with {\em interdependent values}. That is, each agent has her own private signal, and the valu…
Prompt Scheduling for Selfish Agents
Alon Eden, Michal Feldman, Amos Fiat +1
We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic age…
An Economic-Based Analysis of RANKING for Online Bipartite Matching
Alon Eden, Michal Feldman, Amos Fiat +1
In their seminal paper, Karp, Vazirani and Vazirani (STOC'90) introduce the online bipartite matching problem, and the RANKING algorithm, which admits a tight compe…
Max-Min Greedy Matching
Alon Eden, Uriel Feige, Michal Feldman
A bipartite graph that admits a perfect matching is given. One player imposes a permutation over , the other player imposes a permutation over . In the gre…