Michael Schapira Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYi Wang, Michael Schapira, Jennifer Rexford: Neighbor-specific BGP: more flexible routing policies while improving global stability. SIGMETRICS/Performance 2009: 217-228
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer: VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension CoRR abs/0905.1995: (2009)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYi Wang, Michael Schapira, Jennifer Rexford: Neighbor-Specific BGP: More Flexible Routing Policies While Improving Global Stability CoRR abs/0906.3846: (2009)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAaron D. Jaggard, Michael Schapira, Rebecca N. Wright: Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond CoRR abs/0910.1585: (2009)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Feigenbaum, Aaron D. Jaggard, Michael Schapira: Approximate Privacy: Foundations and Quantification CoRR abs/0910.5714: (2009)
2008
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhuva Mu'alem, Michael Schapira: Mechanism design over discrete domains. ACM Conference on Electronic Commerce 2008: 31-37
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVahab S. Mirrokni, Michael Schapira, Jan Vondrák: Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions. ACM Conference on Electronic Commerce 2008: 70-77
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoshe Babaioff, Liad Blumrosen, Moni Naor, Michael Schapira: Informational overhead of incentive compatibility. ACM Conference on Electronic Commerce 2008: 88-97
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos H. Papadimitriou, Michael Schapira, Yaron Singer: On the Hardness of Being Truthful. FOCS 2008: 250-259
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGeorge Christodoulou, Annamária Kovács, Michael Schapira: Bayesian Combinatorial Auctions. ICALP (1) 2008: 820-832
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHagay Levin, Michael Schapira, Aviv Zohar: Interdomain routing and games. STOC 2008: 57-66
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Schapira, Yaron Singer: Inapproximability of Combinatorial Public Projects. WINE 2008: 351-361
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoam Nisan, Michael Schapira, Aviv Zohar: Asynchronous Best-Reply Dynamics. WINE 2008: 531-538
2007
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhuva Mu'alem, Michael Schapira: Setting lower bounds on truthfulness: extended abstract. SODA 2007: 1143-1152
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Feigenbaum, Vijay Ramachandran, Michael Schapira: Incentive-compatible interdomain routing. ACM Conference on Electronic Commerce 2006: 130-139
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShahar Dobzinski, Michael Schapira: An improved approximation algorithm for combinatorial auctions with submodular bidders. SODA 2006: 1064-1073
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShahar Dobzinski, Noam Nisan, Michael Schapira: Truthful randomized mechanisms for combinatorial auctions. STOC 2006: 644-652
2005
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShahar Dobzinski, Noam Nisan, Michael Schapira: Approximation algorithms for combinatorial auctions with complement-free bidders. STOC 2005: 610-618

Coauthor Index

1Moshe Babaioff [11]
2Liad Blumrosen [11]
3George Christodoulou [9]
4Shahar Dobzinski [1] [2] [3]
5Joan Feigenbaum [4] [14]
6Aaron D. Jaggard [14] [15]
7Annamária Kovács [9]
8Hagay Levin [8]
9Vahab S. Mirrokni (Seyed Vahab Mirrokni) [12]
10Elchanan Mossel [17]
11Ahuva Mu'alem (Ahuva Mu'alem Weil) [5] [13]
12Moni Naor [11]
13Noam Nisan [1] [2] [6]
14Christos H. Papadimitriou [10] [17]
15Vijay Ramachandran [4]
16Jennifer Rexford [16] [18]
17Yaron Singer [7] [10] [17]
18Jan Vondrák [12]
19Yi Wang [16] [18]
20Rebecca N. Wright [15]
21Aviv Zohar [6] [8]

Copyright © Mon Nov 9 16:52:13 2009 by Michael Ley (ley@uni-trier.de)