6 citations · 10 across the 20 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.GT2018
Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions
Tomer Ezra, Michal Feldman, Eric Neyman +2
We study the communication complexity of welfare maximization in combinatorial auctions with items and two subadditive bidders. A -approximation can be guaranteed…
cs.GT2018
Prophets and Secretaries with Overbooking
Tomer Ezra, Michal Feldman, Ilan Nehama
The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to…