Searching for authors named "Michael Schapira" – sorted by Relevance.
-
Setting lower bounds on truthfulness
- Setting Lower Bounds on Truthfulness Ahuva Mu’alem ∗ Michael Schapira † Abstract We present
- Cited by 13 (2 self) – Add To MetaCart
-
Optimal upper and lower approximation bounds for k-duplicates combinatorial auctions. Working paper, the Hebrew
- Dobzinski Michael Schapira* December 3, 2005 Abstract We study the allocation problem in combinatorial
- Cited by 6 (1 self) – Add To MetaCart
-
Interdomain routing and games
- Interdomain Routing and Games Hagay Levin ∗ Michael Schapira † Aviv Zohar ‡ Abstract We present a
- Cited by 2 (0 self) – Add To MetaCart
-
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
- Mirrokni ∗ Michael Schapira † Jan Vondrák ‡ November 14, 2007 Abstract We provide tight information
- Cited by 6 (3 self) – Add To MetaCart
-
Approximation algorithms for combinatorial auctions with complement-free bidders
- ∗ Noam Nisan † Michael Schapira ‡ February 24, 2005 Abstract We exhibit three approximation algorithms
- Cited by 48 (11 self) – Add To MetaCart
-
Truthful randomized mechanisms for combinatorial auctions
- Truthful Randomized Mechanisms for Combinatorial Auctions Shahar Dobzinski Noam Nisan Michael
- Cited by 32 (8 self) – Add To MetaCart

