The following pages link to Rakesh V. Vohra (Q581215):
Displaying 50 items.
- (Q478118) (redirect page) (← links)
- (Q1304529) (redirect page) (← links)
- Selecting a discrete portfolio (Q478119) (← links)
- An on-line assignment problem with random effectiveness and costly information (Q581216) (← links)
- Strategy-proof location on a network (Q697960) (← links)
- On ascending Vickrey auctions for heterogeneous objects (Q869853) (← links)
- Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
- Simultaneous selection (Q906442) (← links)
- New algorithms for an ancient scheduling problem. (Q960514) (← links)
- An optimal auction for capacity constrained bidders: a network perspective (Q1006569) (← links)
- Foundations of multi-agent learning: introduction to the special issue (Q1028916) (← links)
- Optimal auctions for asymmetrically budget constrained bidders (Q1029531) (← links)
- Distance weighted voting and a single facility location problem (Q1120459) (← links)
- An axiomatic characterization of some locations in trees (Q1266519) (← links)
- The replacement principle and tree structured preferences (Q1292451) (← links)
- Quality-adjusted life years (QALY) utility models under expected utility and rank dependent utility assumptions (Q1304530) (← links)
- Applying decision-making approaches to health risk-taking behaviors: Progress and remaining challenges (Q1304535) (← links)
- On dependent randomized rounding algorithms (Q1306458) (← links)
- Pareto optimality and a class of set covering heuristics (Q1309875) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- On the total heights of random rooted binary trees (Q1333336) (← links)
- Covering with Latin transversals (Q1345959) (← links)
- Calibrated learning and correlated equilibrium (Q1378013) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Correlated equilibrium payoffs and public signalling in absorbing games (Q1414439) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)
- Towards equitable distribution via proportional equity constraints (Q1803612) (← links)
- Regret in the on-line decision problem (Q1818283) (← links)
- Finding the most vital arcs in a network (Q1823164) (← links)
- Probabilistic analysis of a heuristic for the dual bin packing problem (Q1824388) (← links)
- Riffle shuffles, cycles, and descents (Q1842567) (← links)
- A kinetic approach to the random \(f\)-graph process. Paths, cycles and components (Q1917316) (← links)
- Characterization of additive cost sharing methods (Q1927362) (← links)
- Solitary subgraphs of random graphs (Q1970715) (← links)
- Testing alone is insufficient (Q2128942) (← links)
- Free and perfectly safe but only partially effective vaccines can harm everyone (Q2195702) (← links)
- Optimal on-line allocation rules with verification (Q2292610) (← links)
- Optimal auctions with financially constrained buyers (Q2439904) (← links)
- Anonymous monotonic social welfare functions (Q2496234) (← links)
- Matroidal approximations of independence systems (Q2661525) (← links)
- Relationship externalities (Q2682014) (← links)
- Correlated Equilibrium in Quitting Games (Q2757685) (← links)
- An Axiomatic Characterization of a Class of Locations in Tree Networks (Q2770134) (← links)
- Combinatorial Auctions: A Survey (Q2884560) (← links)
- An Ascending Vickrey Auction for Selling Bases of a Matroid (Q3098763) (← links)
- (Q3100563) (← links)
- A Probabilistic Analysis of the K-Location Problem (Q3136634) (← links)
- (Q3374081) (← links)
- (Q3447232) (← links)
