17 citations · 18 across the 4 of their papers we have counts for
5 papers
No Ascending Auction can find Equilibrium for SubModular valuations
Oren Ben-Zwi, Ilan Newman
We show that no efficient ascending auction can guarantee to find even a minimal envy-free price vector if all valuations are submodular, assuming a basic complexity theory's assum…
Walrasian's Characterization and a Universal Ascending Auction
Oren Ben-Zwi
We introduce a novel characterization of all Walrasian price vectors in terms of forbidden over- and under demanded sets for monotone gross substitute combinatorial auctions. For a…
Ad Exchange: Envy-Free Auctions with Mediators
Oren Ben-Zwi, Monika Henzinger, Veronika Loitzenbauer
Ad exchanges are an emerging platform for trading advertisement slots on the web with billions of dollars revenue per year. Every time a user visits a web page, the publisher of th…
Ascending auctions and Walrasian equilibrium
Oren Ben-Zwi, Ron Lavi, Ilan Newman
We present a family of submodular valuation classes that generalizes gross substitute. We show that Walrasian equilibrium always exist for one class in this family, and there is a…
Optimal Bi-Valued Auctions
Oren Ben-Zwi, Ilan Newman
We investigate \emph{bi-valued} auctions in the digital good setting and construct an explicit polynomial time deterministic auction. We prove an unconditional tight lower bound wh…