Yogeshwer Sharma 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing truthful multi-armed bandit mechanisms: extended abstract. ACM Conference on Electronic Commerce 2009: 79-88
2008
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobert D. Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma: Regret Bounds for Sleeping Experts and Bandits. COLT 2008: 425-436
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. WAOA 2008: 174-187
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing Truthful Multi-Armed Bandit Mechanisms CoRR abs/0812.2291: (2008)
2007
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYogeshwer Sharma, David P. Williamson: Stackelberg thresholds in network routing games or the value of altruism. ACM Conference on Electronic Commerce 2007: 93-102
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYogeshwer Sharma, Chaitanya Swamy, David P. Williamson: Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA 2007: 1275-1284

Coauthor Index

1Moshe Babaioff [3] [6]
2Robert D. Kleinberg (Robert Kleinberg) [5]
3Chandrashekhar Nagarajan [4]
4Alexandru Niculescu-Mizil [5]
5Aleksandrs Slivkins [3] [6]
6Chaitanya Swamy [1]
7David P. Williamson [1] [2] [4]

Colors in the list of coauthors

Copyright © Sat Nov 14 20:26:04 2009 by Michael Ley (ley@uni-trier.de)