Yogeshwer Sharma

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2010
j2		Robert Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma: Regret bounds for sleeping experts and bandits. Machine Learning 80(2-3): 245-272 (2010)
	2009
j1		Yogeshwer Sharma, David P. Williamson: Stackelberg thresholds in network routing games or the value of altruism. Games and Economic Behavior 67(1): 174-190 (2009)
c5		Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing truthful multi-armed bandit mechanisms: extended abstract. ACM Conference on Electronic Commerce 2009: 79-88
	2008
c4		Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yogeshwer Sharma: Regret Bounds for Sleeping Experts and Bandits. COLT 2008: 425-436
c3		Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson: Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements. WAOA 2008: 174-187
i1		Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins: Characterizing Truthful Multi-Armed Bandit Mechanisms. CoRR abs/0812.2291 (2008)
	2007
c2		Yogeshwer Sharma, David P. Williamson: Stackelberg thresholds in network routing games or the value of altruism. ACM Conference on Electronic Commerce 2007: 93-102
c1		Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson: Approximation algorithms for prize collecting forest problems with submodular penalty functions. SODA 2007: 1275-1284

Coauthor Index

1	Moshe Babaioff	[c5] [i1]
2	Robert D. Kleinberg (Robert Kleinberg)	[j2] [c4]
3	Chandrashekhar Nagarajan	[c3]
4	Alexandru Niculescu-Mizil	[j2] [c4]
5	Aleksandrs Slivkins	[c5] [i1]
6	Chaitanya Swamy	[c1]
7	David P. Williamson	[j1] [c3] [c2] [c1]

Last update Thu May 23 01:15:21 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page