Rakesh Vohra
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
28 | EE | Lance Fortnow, Rakesh Vohra: The complexity of forecast testing: abstract. ACM Conference on Electronic Commerce 2008: 139 |
27 | EE | 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 |
26 | EE | Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra: Dynamic cost-per-action mechanisms and applications to online advertising. WWW 2008: 179-188 |
25 | EE | 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 | ||
24 | Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra: On revenue equivalence in truthful mechanisms. CTW 2007: 69-72 | |
23 | EE | Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra: On Revenue Equivalence in Truthful Mechanisms. Computational Social Systems and the Internet 2007 |
22 | EE | Rakesh V. Vohra, Michael P. Wellman: Foundations of multi-agent learning: Introduction to the special issue. Artif. Intell. 171(7): 363-364 (2007) |
21 | EE | 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 | ||
20 | EE | Eyal Beigman, Rakesh Vohra: Learning from revealed preference. ACM Conference on Electronic Commerce 2006: 36-42 |
19 | EE | Rakesh V. Vohra: Predicting the "unpredictable". SODA 2006: 132 |
18 | EE | Lance Fortnow, Rakesh Vohra: The Complexity of Forecast Testing. Electronic Colloquium on Computational Complexity (ECCC) 13(149): (2006) |
2005 | ||
17 | EE | Hongwei Gui, Rudolf Müller, Rakesh V. Vohra: Dominant Strategy Mechanisms with Multidimensional Types. Computing and Markets 2005 |
2003 | ||
16 | EE | Sven de Vries, Rakesh V. Vohra: Combinatorial Auctions: A Survey. INFORMS Journal on Computing 15(3): 284-309 (2003) |
15 | EE | Alvaro Sandroni, Rann Smorodinsky, Rakesh V. Vohra: Calibration with Many Checking Rules. Math. Oper. Res. 28(1): 141-153 (2003) |
14 | EE | Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra: Integer Programming and Arrovian Social Welfare Functions. Math. Oper. Res. 28(2): 309-326 (2003) |
2002 | ||
13 | EE | Jay Sethuraman, Chung-Piaw Teo, Rakesh Vohra: Integer Programming and Arrovian Social Welfare Functions. IPCO 2002: 194-211 |
2001 | ||
12 | EE | E. Solan, Rakesh V. Vohra: Correlated Equilibrium in Quitting Games. Math. Oper. Res. 26(3): 601-610 (2001) |
1999 | ||
11 | EE | Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Analysis of LP relaxations for multiway and multicut problems. Networks 34(2): 102-114 (1999) |
10 | EE | Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3): 105-114 (1999) |
1998 | ||
9 | Dimitris Bertsimas, Rakesh V. Vohra: Rounding algorithms for covering problems. Math. Program. 80: 63-89 (1998) | |
1996 | ||
8 | Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On Dependent Randomized Rounding Algorithms. IPCO 1996: 330-344 | |
1995 | ||
7 | Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems. IPCO 1995: 29-39 | |
6 | 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 | ||
5 | EE | Rakesh Vohra, Nicholas G. Hall: A Probabilistic Analysis of the Maximal Covering Location Problem. Discrete Applied Mathematics 43(2): 175-183 (1993) |
4 | Nicholas G. Hall, Rakesh V. Vohra: Towards equitable distribution via proportional equity constraints. Math. Program. 58: 287-294 (1993) | |
1992 | ||
3 | Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra: New Algorithms for an Ancient Scheduling Problem STOC 1992: 51-58 | |
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) |
1 | Junjik Bae | [25] |
2 | Yair Bartal | [3] [6] |
3 | Eyal Beigman | [20] [25] |
4 | Randall Berry (Randall A. Berry) | [25] |
5 | Dimitris Bertsimas | [7] [8] [9] [10] [11] |
6 | Sushil Bikhchandani | [27] |
7 | Amos Fiat | [3] [6] |
8 | Lance Fortnow | [18] [28] |
9 | Dean P. Foster | [1] |
10 | Hongwei Gui | [17] |
11 | Nicholas G. Hall | [4] [5] |
12 | Birgit Heydenreich | [23] [24] |
13 | Michael L. Honig | [25] |
14 | Howard J. Karloff | [3] [6] |
15 | Daniel J. Kleitman | [2] |
16 | Rudolf Müller | [17] [23] [24] |
17 | Hamid Nazerzadeh | [26] |
18 | Marc E. Posner | [21] |
19 | Amin Saberi | [26] |
20 | Alvaro Sandroni | [15] |
21 | James Schummer | [27] |
22 | Jay Sethuraman | [13] [14] |
23 | Rann Smorodinsky | [15] |
24 | E. Solan | [12] |
25 | Chung-Piaw Teo | [7] [8] [10] [11] [13] [14] |
26 | Marc Uetz | [23] [24] |
27 | Sven de Vries | [16] [21] [27] |
28 | Michael P. Wellman | [22] |