Rakesh V. Vohra

Oper. Res., 2021

Best vs. All: Equity and Accuracy of Standardized Test Score Reporting.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Matroidal approximations of independence systems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2020

The Value of Sharing Intermittent Spectrum.

[BibT_eX]

[DOI]

Manag. Sci., 2020

Free and perfectly safe but only partially effective vaccines can harm everyone.

[BibT_eX]

[DOI]

Eduard Talamàs

Games Econ. Behav., 2020

Constrained Trading Networks.

[BibT_eX]

[DOI]

Can Kizilkale

CoRR, 2020

Moment Multicalibration for Uncertainty Estimation.

[BibT_eX]

[DOI]

CoRR, 2020

Fair Prediction with Endogenous Behavior.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Strategic Formation and Reliability of Supply Chain Networks.

[BibT_eX]

[DOI]

Victor Amelkin

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019

Stable Matching with Proportionality Constraints.

[BibT_eX]

[DOI]

Thành Nguyen

Oper. Res., 2019

Algorithmic and Economic Perspectives on Fairness.

[BibT_eX]

[DOI]

David C. Parkes

et al.

CoRR, 2019

Yield Uncertainty and Strategic Formation of Supply Chain Networks.

[BibT_eX]

[DOI]

Victor Amelkin

CoRR, 2019

Optimal On-Line Allocation Rules with Verification.

[BibT_eX]

[DOI]

Markos Epitropou

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

2017

Fast Convergence in the Double Oral Auction.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2017

Fairness Incentives for Myopic Agents.

[BibT_eX]

[DOI]

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

2016

Do prices coordinate markets?

[BibT_eX]

[DOI]

SIGecom Exch., 2016

Assignment problems with complementarities.

[BibT_eX]

[DOI]

Thành Nguyen

Ahmad Peivandi

J. Econ. Theory, 2016

The Cost of Free Spectrum.

[BibT_eX]

[DOI]

Oper. Res., 2016

Simultaneous selection.

[BibT_eX]

[DOI]

Wojciech Olszewski

Discret. Appl. Math., 2016

2015

Near Feasible Stable Matchings.

[BibT_eX]

[DOI]

Thanh Nguyen

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

2014

Optimal auctions with financially constrained buyers.

[BibT_eX]

[DOI]

Mallesh M. Pai

J. Econ. Theory, 2014

The impact of investment on price competition in unlicensed spectrum.

[BibT_eX]

[DOI]

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

2013

Optimal Dynamic Auctions and Simple Index Rules.

[BibT_eX]

[DOI]

Mallesh M. Pai

Math. Oper. Res., 2013

Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2013

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

[BibT_eX]

[DOI]

Hamid Nazerzadeh

Amin Saberi

Oper. Res., 2013

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

[BibT_eX]

[DOI]

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

Market structures for wireless services with shared spectrum.

[BibT_eX]

[DOI]

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

2012

Newsvendor model of capacity sharing.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2012

Optimization and mechanism design.

[BibT_eX]

[DOI]

Math. Program., 2012

Investment and competition in unlicensed spectrum.

[BibT_eX]

[DOI]

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

Principles of Pricing - An Analytical Approach.

[BibT_eX]

[DOI]

P. V. (Sundar) Balakrishnan

Lakshman Krishnamurthi

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

2011

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

[BibT_eX]

[DOI]

Juan Camilo Gómez

Math. Soc. Sci., 2011

An Ascending Vickrey Auction for Selling Bases of a Matroid.

[BibT_eX]

[DOI]

Oper. Res., 2011

Spectrum markets with interference complementarities.

[BibT_eX]

[DOI]

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

2010

Extendability and von Neuman-Morgenstern stability of the core.

[BibT_eX]

[DOI]

Kamal Jain

Int. J. Game Theory, 2010

Spectrum markets: motivation, challenges, and implications.

[BibT_eX]

[DOI]

Randall Berry

Michael L. Honig

IEEE Commun. Mag., 2010

2009

On the efficiency of sequential auctions for spectrum sharing.

[BibT_eX]

[DOI]

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

2008

Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2008

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

[BibT_eX]

[DOI]

Hamid Nazerzadeh

Amin Saberi

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

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

[BibT_eX]

[DOI]

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

The complexity of forecast testing: abstract.

[BibT_eX]

[DOI]

Lance Fortnow

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

2007

Polyhedral Properties of the <i>K</i> -median Problem on a Tree.

[BibT_eX]

[DOI]

Marc E. Posner

Math. Program., 2007

On ascending Vickrey auctions for heterogeneous objects.

[BibT_eX]

[DOI]

James Schummer

J. Econ. Theory, 2007

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

[BibT_eX]

[DOI]

Michael P. Wellman

Artif. Intell., 2007

Efficiency of Sequential Bandwidth and Power Auctions With Rate Utilities.

[BibT_eX]

[DOI]

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

On revenue equivalence in truthful mechanisms.

[BibT_eX]

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

Efficiency bounds for sequential resource allocation auctions.

[BibT_eX]

[DOI]

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

2006

Anonymous monotonic social welfare functions.

[BibT_eX]

[DOI]

Jay Sethuraman

J. Econ. Theory, 2006

Mini special issue: Electronic Market Design.

[BibT_eX]

[DOI]

Eric van Damme

Rudolf Müller

Games Econ. Behav., 2006

The Complexity of Forecast Testing.

[BibT_eX]

[DOI]

Lance Fortnow

Electron. Colloquium Comput. Complex., 2006

Predicting the "unpredictable".

[BibT_eX]

[DOI]

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

Learning from revealed preference.

[BibT_eX]

[DOI]

Eyal Beigman

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

2005

Dominant Strategy Mechanisms with Multidimensional Types.

[BibT_eX]

[DOI]

Hongwei Gui

Rudolf Müller

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

2003

Integer Programming and Arrovian Social Welfare Functions.

[BibT_eX]

[DOI]

Jay Sethuraman

Math. Oper. Res., 2003

Calibration with Many Checking Rules.

[BibT_eX]

[DOI]

Alvaro Sandroni

Rann Smorodinsky

Math. Oper. Res., 2003

Auctions for Procuring Options.

[BibT_eX]

[DOI]

James Schummer

Oper. Res., 2003

Combinatorial Auctions: A Survey.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2003

2002

Strategy-proof Location on a Network.

[BibT_eX]

[DOI]

James Schummer

J. Econ. Theory, 2002

Correlated equilibrium payoffs and public signalling in absorbing games.

[BibT_eX]

[DOI]

Eilon Solan

Int. J. Game Theory, 2002

2001

Correlated Equilibrium in Quitting Games.

[BibT_eX]

[DOI]

Eilon Solan

Math. Oper. Res., 2001

1999

On dependent randomized rounding algorithms.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1999

Analysis of LP relaxations for multiway and multicut problems.

[BibT_eX]

[DOI]

Networks, 1999

1998

Rounding algorithms for covering problems.

[BibT_eX]

[DOI]

Math. Program., 1998

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

[BibT_eX]

[DOI]

Oper. Res., 1998

1997

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

[BibT_eX]

[DOI]

Paul Mireault

James B. Orlin

Oper. Res., 1997

1995

New Algorithms for an Ancient Scheduling Problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Nonlinear Formulations and Improved Randomized Approximation Algorithms for Multicut Problems.

[BibT_eX]

[DOI]

Alexander H. G. Rinnooy Kan

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Average Case Analysis of a Heuristic for the Assignment Problem.

[BibT_eX]

[DOI]

Richard M. Karp

Math. Oper. Res., 1994

1993

Towards equitable distribution via proportional equity constraints.

[BibT_eX]

[DOI]

Math. Program., 1993

Reply to Professor Clemen.

[BibT_eX]

[DOI]

Oper. Res., 1993

A Randomization Rule for Selecting Forecasts.

[BibT_eX]

[DOI]

Oper. Res., 1993

A Probabilistic Analysis of the Maximal Covering Location Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Pareto optimality and a class of set covering heuristics.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1993

1992

Book Review.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1992

1990

Computing the Bandwidth of Interval Graphs.

[BibT_eX]

[DOI]

Daniel J. Kleitman

SIAM J. Discret. Math., 1990

1989

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

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1989

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

Probabilistic analysis of the longest hamiltonian tour problem.

[BibT_eX]

[DOI]