Searching for authors named "Liad Blumrosen" – sorted by Relevance.
-
On the Computational Power of Demand Queries
- On the Computational Power of Demand Queries Liad Blumrosen ∗ and Noam Nisan † Abstract We study
- Add To MetaCart
-
On the Computational Power of Iterative Auctions I: Demand Queries
- On the Computational Power of Iterative Auctions I: Demand Queries Liad Blumrosen and Noam
- Cited by 10 (6 self) – Add To MetaCart
-
Computationally-feasible truthful auctions for convex bundles
- Computationally-Feasible Truthful Auctions for Convex Bundles Moshe Babaioff and Liad Blumrosen
- Cited by 1 (0 self) – Add To MetaCart
-
On the computational power of iterative auctions ii: Ascending auctions
- On the Computational Power of Iterative Auctions II: Ascending Auctions Liad Blumrosen and Noam
- Cited by 6 (4 self) – Add To MetaCart
-
Welfare maximization in congestion games
- Welfare Maximization in Congestion Games Liad Blumrosen Shahar Dobzinski ∗ Abstract Congestion
- Cited by 3 (1 self) – Add To MetaCart
-
Implementation with a bounded action space
- ACTION SPACE by LIAD BLUMROSEN and MICHAL FELDMAN Discussion Paper # 412 December 2005 תוילנויצרה רקחל
- Cited by 9 (1 self) – Add To MetaCart
-
Auctions with Severely Bounded Communication
- Auctions with severely bounded communication Liad Blumrosen and Noam Nisan School of Engineering
- Cited by 23 (3 self) – Add To MetaCart
-
Multi-player and multi-round auctions with severely bounded communication. ESA
- Multi-player and Multi-round Auctions with Severely Bounded Communication Liad Blumrosen1, Noam
- Cited by 13 (3 self) – Add To MetaCart
-
On Line Markets for Distributed Object Services: the MAJIC system
- On Line Markets for Distributed Object Services: the MAJIC system Lior Levy, Liad Blumrosen
- Cited by 2 (0 self) – Add To MetaCart
-
Computationally-Feasible Truthful Auctions for Convex Bundles
- Computationally-Feasible Truthful Auctions for Convex Bundles Moshe Babaioff and Liad Blumrosen
- Add To MetaCart

