Yashodhan Kanoria

Ilan Lobel

Jiaqi Lu

Math. Oper. Res., 2024

Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure.

[BibT_eX]

[DOI]

Manag. Sci., 2024

The Fault in Our Recommendations: On the Perils of Optimizing the Measurable.

[BibT_eX]

[DOI]

Omar Besbes

Akshit Kumar

Proceedings of the 18th ACM Conference on Recommender Systems, 2024

2023

Neural Inventory Control in Networks via Hindsight Differentiable Policy Optimization.

[BibT_eX]

[DOI]

Matias Alvo

Daniel Russo

CoRR, 2023

Feature Based Dynamic Matching.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022

The Multisecretary problem with many types.

[BibT_eX]

[DOI]

Omar Besbes

Akshit Kumar

CoRR, 2022

Dynamic Spatial Matching.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

The Multi-secretary Problem with Many Types.

[BibT_eX]

[DOI]

Omar Besbes

Akshit Kumar

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Decentralized Online Convex Optimization in Networked Systems.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

2021

Managing Congestion in Matching Markets.

[BibT_eX]

[DOI]

Nick Arnosti

Manuf. Serv. Oper. Manag., 2021

Facilitating the Search for Partners on Matching Platforms.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Incentive-Compatible Learning of Reserve Prices for Repeated Auctions.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

Oper. Res., 2021

Matching While Learning.

[BibT_eX]

[DOI]

Vijay Kamble

Oper. Res., 2021

Dynamic Matching under Spatial Frictions.

[BibT_eX]

[DOI]

CoRR, 2021

In Which Matching Markets Do Costly Compatibility Inspections Lead to a Deadlock?

[BibT_eX]

[DOI]

Nicole Immorlica

Jiaqi Lu

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

In which matching markets does the short side enjoy an advantage?

[BibT_eX]

[DOI]

Seungki Min

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations.

[BibT_eX]

[DOI]

Manag. Sci., 2020

Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations.

[BibT_eX]

[DOI]

Manag. Sci., 2020

Which Random Matching Markets Exhibit a Stark Effect of Competition?

[BibT_eX]

[DOI]

Seungki Min

CoRR, 2020

Dynamic Reserve Prices for Repeated Auctions: Learning from Bids.

[BibT_eX]

[DOI]

Partha Pratim Chakrabarti

Hamid Nazerzadeh

CoRR, 2020

2019

Centralized Admissions for Engineering Colleges in India.

[BibT_eX]

[DOI]

Surender Baswana

Sharat Chandran

Utkarsh Patange

INFORMS J. Appl. Anal., 2019

Joint Seat Allocation 2018: An algorithmic perspective.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Convergence of the Core in Assignment Markets.

[BibT_eX]

[DOI]

Jay Sethuraman

Oper. Res., 2018

State Dependent Control of Closed Queueing Networks.

[BibT_eX]

[DOI]

Siddhartha Banerjee

Proceedings of the Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems, 2018

2017

Efficient Dynamic Barter Exchange.

[BibT_eX]

[DOI]

Oper. Res., 2017

Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions.

[BibT_eX]

[DOI]

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

Communication Requirements and Informative Signaling in Matching Markets.

[BibT_eX]

[DOI]

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

2016

Know Your Customer: Multi-armed Bandits with Capacity Constraints.

[BibT_eX]

[DOI]

Vijay Kamble

CoRR, 2016

The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015

Bargaining dynamics in exchange networks.

[BibT_eX]

[DOI]

J. Econ. Theory, 2015

How Hard is Computing Parity with Noisy Communications?

[BibT_eX]

[DOI]

Chinmoy Dutta

D. Manjunath

Jaikumar Radhakrishnan

CoRR, 2015

The size of the core in assignment markets.

[BibT_eX]

[DOI]

Jay Sethuraman

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A dynamic model of barter exchange.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Dynamic Reserve Prices for Repeated Auctions: Learning from Bids - Working Paper.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Managing congestion in decentralized matching markets.

[BibT_eX]

[DOI]

Nick Arnosti

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Optimal Coding for the Binary Deletion Channel With Small Deletion Probability.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Tractable Bayesian Social Learning on Trees.

[BibT_eX]

[DOI]

Omer Tamuz

IEEE J. Sel. Areas Commun., 2013

Unbalanced random matching markets.

[BibT_eX]

[DOI]

Itai Ashlagi

Jacob D. Leshno

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

The set of solutions of random XORSAT formulae.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Optimal coding for the deletion channel with small deletion probability

[BibT_eX]

[DOI]

CoRR, 2011

Efficient Bayesian Social Learning on Trees

[BibT_eX]

[DOI]

Omer Tamuz

CoRR, 2011

Fast Convergence of Natural Bargaining Dynamics in Exchange Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Subexponential convergence for information aggregation on regular trees.

[BibT_eX]

[DOI]

Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Distributed storage for intermittent energy sources: Control design and performance limits.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Robust max-product belief propagation.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010

An FPTAS for Bargaining Networks with Unequal Bargaining Powers.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

On the deletion channel with small deletion probability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Statistical static timing analysis using Markov chain Monte Carlo.

[BibT_eX]

[DOI]

Subhasish Mitra

Proceedings of the Design, Automation and Test in Europe, 2010

2009

A Natural Dynamics for Bargaining on Exchange Networks

[BibT_eX]

[DOI]

CoRR, 2009

2008

A tight lower bound for parity in noisy communication networks.

[BibT_eX]

[DOI]

Chinmoy Dutta

D. Manjunath

Jaikumar Radhakrishnan

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

2007

On Distributed Computation in Noisy Random Planar Networks.

[BibT_eX]

[DOI]