The following pages link to Liad Blumrosen (Q380912):
Displayed 18 items.
- The communication burden of payment determination (Q380913) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- Informational limitations of ascending combinatorial auctions (Q972880) (← links)
- Auctions with online supply (Q2343399) (← links)
- Mechanism design with a restricted action space (Q2437830) (← links)
- (Almost) efficient mechanisms for bilateral trading (Q2667262) (← links)
- Approximating Gains-from-Trade in Bilateral Trading (Q2959847) (← links)
- Multilateral Deferred-Acceptance Mechanisms (Q3460787) (← links)
- (Q3524720) (← links)
- On the Computational Power of Demand Queries (Q3586184) (← links)
- (Q3624052) (← links)
- (Q4598283) (← links)
- (Q5111466) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313036) (← links)
- Algorithms - ESA 2003 (Q5897238) (← links)
- How bad is the merger paradox? (Q6050129) (← links)
- Combinatorial reallocation mechanisms (Q6130328) (← links)
- How bad is the merger paradox? (Q6164496) (← links)