Rakesh V. Vohra

Rakesh Vohra

	2008
30		Lance Fortnow, Rakesh Vohra: The complexity of forecast testing: abstract. ACM Conference on Electronic Commerce 2008: 139
29		Sushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra: Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. SODA 2008: 864-873
28		Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra: Dynamic cost-per-action mechanisms and applications to online advertising. WWW 2008: 179-188
27		Junjik Bae, Eyal Beigman, Randall A. Berry, Michael L. Honig, Rakesh V. Vohra: Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing. IEEE Journal on Selected Areas in Communications 26(7): 1193-1203 (2008)
	2007
26		Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra: On revenue equivalence in truthful mechanisms. CTW 2007: 69-72
25		Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra: On Revenue Equivalence in Truthful Mechanisms. Computational Social Systems and the Internet 2007
24		Rakesh V. Vohra, Michael P. Wellman: Foundations of multi-agent learning: Introduction to the special issue. Artif. Intell. 171(7): 363-364 (2007)
23		Sven de Vries, Marc E. Posner, Rakesh V. Vohra: Polyhedral Properties of the K -median Problem on a Tree. Math. Program. 110(2): 261-285 (2007)
	2006
22		Eyal Beigman, Rakesh Vohra: Learning from revealed preference. ACM Conference on Electronic Commerce 2006: 36-42
21		Rakesh V. Vohra: Predicting the "unpredictable". SODA 2006: 132
20		Lance Fortnow, Rakesh Vohra: The Complexity of Forecast Testing. Electronic Colloquium on Computational Complexity (ECCC) 13(149): (2006)
	2005
19		Hongwei Gui, Rudolf Müller, Rakesh V. Vohra: Dominant Strategy Mechanisms with Multidimensional Types. Computing and Markets 2005
	2003
18		Sven de Vries, Rakesh V. Vohra: Combinatorial Auctions: A Survey. INFORMS Journal on Computing 15(3): 284-309 (2003)
17		Alvaro Sandroni, Rann Smorodinsky, Rakesh V. Vohra: Calibration with Many Checking Rules. Math. Oper. Res. 28(1): 141-153 (2003)
16		Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra: Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28(2): 309-326 (2003)
15		James Schummer, Rakesh V. Vohra: Auctions for Procuring Options. Operations Research 51(1): 41-51 (2003)
	2002
14		Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra: Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211
	2001
13		E. Solan, Rakesh V. Vohra: Correlated Equilibrium in Quitting Games. Math. Oper. Res. 26(3): 601-610 (2001)
	1999
12		Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Analysis of LP relaxations for multiway and multicut problems. Networks 34(2): 102-114 (1999)
11		Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3): 105-114 (1999)
	1998
10		Dimitris Bertsimas, Rakesh V. Vohra: Rounding algorithms for covering problems. Math. Program. 80: 63-89 (1998)
	1996
9		Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On Dependent Randomized Rounding Algorithms. IPCO 1996: 330-344
	1995
8		Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. IPCO 1995: 29-39
7		Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem. J. Comput. Syst. Sci. 51(3): 359-366 (1995)
	1993
6		Rakesh Vohra, Nicholas G. Hall: A Probabilistic Analysis of the Maximal Covering Location Problem. Discrete Applied Mathematics 43(2): 175-183 (1993)
5		Nicholas G. Hall, Rakesh V. Vohra: Towards equitable distribution via proportional equity constraints. Math. Program. 58: 287-294 (1993)
	1992
4		Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem STOC 1992: 51-58
3		Rakesh V. Vohra: Book Review. INFORMS Journal on Computing 4(1): 99 (1992)
	1990
2		Daniel J. Kleitman, Rakesh Vohra: Computing the Bandwidth of Interval Graphs. SIAM J. Discrete Math. 3(3): 373-375 (1990)
	1989
1		Dean P. Foster, Rakesh Vohra: Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem. Inf. Process. Lett. 31(6): 287-290 (1989)

Coauthor Index

1	Junjik Bae	[27]
2	Yair Bartal	[4] [7]
3	Eyal Beigman	[22] [27]
4	Randall Berry (Randall A. Berry)	[27]
5	Dimitris Bertsimas	[8] [9] [10] [11] [12]
6	Sushil Bikhchandani	[29]
7	Amos Fiat	[4] [7]
8	Lance Fortnow	[20] [30]
9	Dean P. Foster	[1]
10	Hongwei Gui	[19]
11	Nicholas G. Hall	[5] [6]
12	Birgit Heydenreich	[25] [26]
13	Michael L. Honig	[27]
14	Howard J. Karloff	[4] [7]
15	Daniel J. Kleitman	[2]
16	Rudolf Müller	[19] [25] [26]
17	Hamid Nazerzadeh	[28]
18	Marc E. Posner	[23]
19	Amin Saberi	[28]
20	Alvaro Sandroni	[17]
21	James Schummer	[15] [29]
22	Jay Sethuraman	[14] [16]
23	Rann Smorodinsky	[17]
24	E. Solan	[13]
25	Chung-Piaw Teo	[8] [9] [11] [12] [14] [16]
26	Marc Uetz	[25] [26]
27	Sven de Vries	[18] [23] [29]
28	Michael P. Wellman	[24]

Colors in the list of coauthors