# Rakesh V. Vohra

According to our database

Collaborative distances:

^{1}, Rakesh V. Vohra authored at least 79 papers between 1988 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2019

Strategic Formation and Reliability of Supply Chain Networks.

CoRR, 2019

Algorithmic and Economic Perspectives on Fairness.

CoRR, 2019

Yield Uncertainty and Strategic Formation of Supply Chain Networks.

CoRR, 2019

Matroidal Approximations of Independence Systems.

CoRR, 2019

Optimal On-Line Allocation Rules with Verification.

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2017

Fast Convergence in the Double Oral Auction.

ACM Trans. Economics and Comput., 2017

Fairness Incentives for Myopic Agents.

CoRR, 2017

The Value of Sharing Intermittent Spectrum.

CoRR, 2017

Stable Matching with Proportionality Constraints.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016

Do prices coordinate markets?

SIGecom Exchanges, 2016

Assignment problems with complementarities.

J. Economic Theory, 2016

The Cost of Free Spectrum.

Operations Research, 2016

Simultaneous selection.

Discrete Applied Mathematics, 2016

Do prices coordinate markets?

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Competitive Equilibrium and Trading Networks: A Network Flow Approach.

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015

The Cost of Free Spectrum.

CoRR, 2015

Fast Convergence in the Double Oral Auction.

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Near Feasible Stable Matchings.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Optimal auctions with financially constrained buyers.

J. Economic Theory, 2014

The impact of investment on price competition in unlicensed spectrum.

Proceedings of the 2014 Proceedings IEEE INFOCOM Workshops, Toronto, ON, Canada, April 27, 2014

2013

Optimal Dynamic Auctions and Simple Index Rules.

Math. Oper. Res., 2013

Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities.

IEEE Journal on Selected Areas in Communications, 2013

Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising.

Operations Research, 2013

On the nature of revenue-sharing contracts to incentivize spectrum-sharing.

Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Market structures for wireless services with shared spectrum.

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Newsvendor model of capacity sharing.

SIGMETRICS Performance Evaluation Review, 2012

Optimization and mechanism design.

Math. Program., 2012

Investment and competition in unlicensed spectrum.

Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

Principles of Pricing - An Analytical Approach.

Cambridge University Press, ISBN: 978-1-107-01065-9, 2012

2011

The Tempered Aspirations solution for bargaining problems with a reference point.

Mathematical Social Sciences, 2011

An Ascending Vickrey Auction for Selling Bases of a Matroid.

Operations Research, 2011

Spectrum markets with interference complementarities.

Proceedings of the 9th International Symposium on Modeling and Optimization in Mobile, 2011

2010

Extendability and von Neuman-Morgenstern stability of the core.

Int. J. Game Theory, 2010

Spectrum markets: motivation, challenges, and implications.

IEEE Communications Magazine, 2010

2009

On the efficiency of sequential auctions for spectrum sharing.

Proceedings of the 1st International Conference on Game Theory for Networks, 2009

2008

The complexity of forecast testing.

SIGecom Exchanges, 2008

Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing.

IEEE Journal on Selected Areas in Communications, 2008

Dynamic cost-per-action mechanisms and applications to online advertising.

Proceedings of the 17th International Conference on World Wide Web, 2008

Ascending auctions for integral (poly)matroids with concave nondecreasing separable values.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

The complexity of forecast testing: abstract.

Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

2007

Polyhedral Properties of the

*K*-median Problem on a Tree.
Math. Program., 2007

On ascending Vickrey auctions for heterogeneous objects.

J. Economic Theory, 2007

Foundations of multi-agent learning: Introduction to the special issue.

Artif. Intell., 2007

Efficiency of Sequential Bandwidth and Power Auctions With Rate Utilities.

Proceedings of the 2nd International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications, 2007

On revenue equivalence in truthful mechanisms.

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Efficiency bounds for sequential resource allocation auctions.

Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006

Anonymous monotonic social welfare functions.

J. Economic Theory, 2006

Mini special issue: Electronic Market Design.

Games and Economic Behavior, 2006

The Complexity of Forecast Testing.

Electronic Colloquium on Computational Complexity (ECCC), 2006

Predicting the "unpredictable".

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Learning from revealed preference.

Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

2005

Dominant Strategy Mechanisms with Multidimensional Types.

Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

2003

Integer Programming and Arrovian Social Welfare Functions.

Math. Oper. Res., 2003

Calibration with Many Checking Rules.

Math. Oper. Res., 2003

Auctions for Procuring Options.

Operations Research, 2003

Combinatorial Auctions: A Survey.

INFORMS Journal on Computing, 2003

2002

Strategy-proof Location on a Network.

J. Economic Theory, 2002

Correlated equilibrium payoffs and public signalling in absorbing games.

Int. J. Game Theory, 2002

2001

Correlated Equilibrium in Quitting Games.

Math. Oper. Res., 2001

1999

On dependent randomized rounding algorithms.

Oper. Res. Lett., 1999

Analysis of LP relaxations for multiway and multicut problems.

Networks, 1999

1998

Rounding algorithms for covering problems.

Math. Program., 1998

An Axiomatic Characterization of a Class of Locations in Tree Networks.

Operations Research, 1998

1997

A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines.

Operations Research, 1997

1996

On Dependent Randomized Rounding Algorithms.

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

New Algorithms for an Ancient Scheduling Problem.

J. Comput. Syst. Sci., 1995

Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Average Case Analysis of a Heuristic for the Assignment Problem.

Math. Oper. Res., 1994

1993

Towards equitable distribution via proportional equity constraints.

Math. Program., 1993

Reply to Professor Clemen.

Operations Research, 1993

A Randomization Rule for Selecting Forecasts.

Operations Research, 1993

A Probabilistic Analysis of the Maximal Covering Location Problem.

Discrete Applied Mathematics, 1993

Pareto optimality and a class of set covering heuristics.

Annals OR, 1993

1992

Book Review.

INFORMS Journal on Computing, 1992

New Algorithms for an Ancient Scheduling Problem

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1990

Computing the Bandwidth of Interval Graphs.

SIAM J. Discrete Math., 1990

1989

Absolute bounds on optimal cost for a class of set covering problems.

ZOR - Meth. & Mod. of OR, 1989

Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem.

Inf. Process. Lett., 1989

1988

Probabilistic analysis of the longest hamiltonian tour problem.

Networks, 1988