default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYashodhan Kanoria
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Yash Kanoria
, Pengyu Qian:
Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure. Manag. Sci. 70(8): 5445-5462 (2024)- [j13]Yash Kanoria, Ilan Lobel, Jiaqi Lu:
Managing Customer Churn via Service Mode Control. Math. Oper. Res. 49(2): 1192-1222 (2024) - [c32]Omar Besbes, Yash Kanoria, Akshit Kumar:
The Fault in Our Recommendations: On the Perils of Optimizing the Measurable. RecSys 2024: 200-208 - [c31]Allen Sirolly, Yash Kanoria, Hongyao Ma:
The Impact of Race-Blind and Test-Optional Admissions on Racial Diversity and Merit. EC 2024: 308 - [i21]Omar Besbes, Yash Kanoria, Akshit Kumar:
The Fault in Our Recommendations: On the Perils of Optimizing the Measurable. CoRR abs/2405.03948 (2024) - 2023
- [c30]Yilun Chen, Yash Kanoria, Akshit Kumar, Wenxin Zhang:
Feature Based Dynamic Matching. EC 2023: 451 - [i20]Matias Alvo, Daniel Russo, Yash Kanoria:
Neural Inventory Control in Networks via Hindsight Differentiable Policy Optimization. CoRR abs/2306.11246 (2023) - 2022
- [c29]Yiheng Lin, Judy Gan, Guannan Qu, Yash Kanoria, Adam Wierman:
Decentralized Online Convex Optimization in Networked Systems. ICML 2022: 13356-13393 - [c28]Yash Kanoria:
Dynamic Spatial Matching. EC 2022: 63-64 - [c27]Omar Besbes, Yash Kanoria, Akshit Kumar:
The Multi-secretary Problem with Many Types. EC 2022: 1146-1147 - [i19]Omar Besbes, Yash Kanoria, Akshit Kumar:
The Multisecretary problem with many types. CoRR abs/2205.09078 (2022) - 2021
- [j12]Yash Kanoria, Hamid Nazerzadeh:
Incentive-Compatible Learning of Reserve Prices for Repeated Auctions. Oper. Res. 69(2): 509-524 (2021) - [j11]Ramesh Johari, Vijay Kamble, Yash Kanoria:
Matching While Learning. Oper. Res. 69(2): 655-681 (2021) - [j10]Yash Kanoria, Daniela Sabán:
Facilitating the Search for Partners on Matching Platforms. Manag. Sci. 67(10): 5990-6029 (2021) - [j9]Nick Arnosti, Ramesh Johari, Yash Kanoria:
Managing Congestion in Matching Markets. Manuf. Serv. Oper. Manag. 23(3): 620-636 (2021) - [c26]Yash Kanoria, Seungki Min, Pengyu Qian:
In which matching markets does the short side enjoy an advantage? SODA 2021: 1374-1386 - [c25]Nicole Immorlica, Yash Kanoria, Jiaqi Lu:
In Which Matching Markets Do Costly Compatibility Inspections Lead to a Deadlock? WINE 2021: 553 - [i18]Yash Kanoria:
Dynamic Matching under Spatial Frictions. CoRR abs/2105.07329 (2021) - 2020
- [j8]Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi:
Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations. Manag. Sci. 66(5): 2163-2193 (2020) - [j7]Itai Feigenbaum, Yash Kanoria, Irene Lo, Jay Sethuraman:
Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations. Manag. Sci. 66(11): 5341-5361 (2020) - [c24]Yash Kanoria, Pengyu Qian:
Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure. EC 2020: 503 - [i17]Yash Kanoria, Hamid Nazerzadeh:
Dynamic Reserve Prices for Repeated Auctions: Learning from Bids. CoRR abs/2002.07331 (2020) - [i16]Yash Kanoria, Seungki Min, Pengyu Qian:
Which Random Matching Markets Exhibit a Stark Effect of Competition? CoRR abs/2006.14653 (2020)
2010 – 2019
- 2019
- [j6]Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange:
Centralized Admissions for Engineering Colleges in India. INFORMS J. Appl. Anal. 49(5): 338-354 (2019) - [c23]Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange:
Centralized Admissions for Engineering Colleges in India. EC 2019: 323-324 - [c22]Yash Kanoria, Hamid Nazerzadeh:
Incentive-Compatible Learning of Reserve Prices for Repeated Auctions. WWW (Companion Volume) 2019: 932-933 - [i15]Surender Baswana, P. P. Chakrabarti, Yashodhan Kanoria, Utkarsh Patange, Sharat Chandran:
Joint Seat Allocation 2018: An algorithmic perspective. CoRR abs/1904.06698 (2019) - 2018
- [j5]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
Convergence of the Core in Assignment Markets. Oper. Res. 66(3): 620-636 (2018) - [c21]Siddhartha Banerjee, Yash Kanoria, Pengyu Qian:
State Dependent Control of Closed Queueing Networks. SIGMETRICS (Abstracts) 2018: 2-4 - 2017
- [j4]Ross Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria:
Efficient Dynamic Barter Exchange. Oper. Res. 65(6): 1446-1459 (2017) - [c20]Yash Kanoria, Daniela Sabán:
Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions. EC 2017: 117 - [c19]Ramesh Johari, Vijay Kamble, Yash Kanoria:
Matching while Learning. EC 2017: 119 - [c18]Itai Ashlagi, Mark Braverman, Yash Kanoria, Peng Shi:
Communication Requirements and Informative Signaling in Matching Markets. EC 2017: 263 - 2016
- [c17]Itai Feigenbaum, Yash Kanoria, Irene Lo, Jay Sethuraman:
The Magician's Shuffle: Reusing Lottery Numbers for School Seat Redistribution. WINE 2016: 475 - [i14]Ramesh Johari, Vijay Kamble, Yash Kanoria:
Know Your Customer: Multi-armed Bandits with Capacity Constraints. CoRR abs/1603.04549 (2016) - 2015
- [j3]Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Yash Kanoria, Andrea Montanari:
Bargaining dynamics in exchange networks. J. Econ. Theory 156: 417-454 (2015) - [c16]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. SODA 2015: 1916-1924 - [c15]Ross Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria:
A dynamic model of barter exchange. SODA 2015: 1925-1933 - [i13]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
How Hard is Computing Parity with Noisy Communications? CoRR abs/1502.02290 (2015) - 2014
- [c14]Nick Arnosti, Ramesh Johari, Yash Kanoria:
Managing congestion in decentralized matching markets. EC 2014: 451 - [c13]Yash Kanoria, Hamid Nazerzadeh:
Dynamic Reserve Prices for Repeated Auctions: Learning from Bids - Working Paper. WINE 2014: 232 - [i12]Yash Kanoria, Daniela Sabán, Jay Sethuraman:
The size of the core in assignment markets. CoRR abs/1407.2576 (2014) - 2013
- [j2]Yashodhan Kanoria, Omer Tamuz:
Tractable Bayesian Social Learning on Trees. IEEE J. Sel. Areas Commun. 31(4): 756-765 (2013) - [j1]Yashodhan Kanoria, Andrea Montanari:
Optimal Coding for the Binary Deletion Channel With Small Deletion Probability. IEEE Trans. Inf. Theory 59(10): 6192-6219 (2013) - [c12]Itai Ashlagi, Yashodhan Kanoria, Jacob D. Leshno:
Unbalanced random matching markets. EC 2013: 27-28 - 2012
- [c11]Yashodhan Kanoria, Omer Tamuz:
Tractable Bayesian social learning on trees. ISIT 2012: 2721-2725 - [c10]Morteza Ibrahimi, Yashodhan Kanoria, Matt Kraning, Andrea Montanari:
The set of solutions of random XORSAT formulae. SODA 2012: 760-779 - 2011
- [c9]Morteza Ibrahimi, Adel Javanmard, Yashodhan Kanoria, Andrea Montanari:
Robust max-product belief propagation. ACSCC 2011: 43-49 - [c8]Yashodhan Kanoria, Andrea Montanari, David Tse, Baosen Zhang:
Distributed storage for intermittent energy sources: Control design and performance limits. Allerton 2011: 1310-1317 - [c7]Yashodhan Kanoria, Andrea Montanari:
Subexponential convergence for information aggregation on regular trees. CDC/ECC 2011: 5317-5322 - [c6]Yashodhan Kanoria, Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Andrea Montanari:
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks. SODA 2011: 1518-1537 - [i11]Yashodhan Kanoria, Omer Tamuz:
Efficient Bayesian Social Learning on Trees. CoRR abs/1102.1398 (2011) - [i10]Yashodhan Kanoria, Andrea Montanari:
Subexponential convergence for information aggregation on regular trees. CoRR abs/1104.2939 (2011) - [i9]Yashodhan Kanoria, Andrea Montanari:
Optimal coding for the deletion channel with small deletion probability. CoRR abs/1104.5546 (2011) - [i8]Morteza Ibrahimi, Yashodhan Kanoria, Matt Kraning, Andrea Montanari:
The Set of Solutions of Random XORSAT Formulae. CoRR abs/1107.5377 (2011) - [i7]Yashodhan Kanoria, Andrea Montanari, David Tse, Baosen Zhang:
Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits. CoRR abs/1110.4441 (2011) - [i6]Morteza Ibrahimi, Adel Javanmard, Yashodhan Kanoria, Andrea Montanari:
Robust Max-Product Belief Propagation. CoRR abs/1111.6214 (2011) - 2010
- [c5]Yashodhan Kanoria, Subhasish Mitra, Andrea Montanari:
Statistical static timing analysis using Markov chain Monte Carlo. DATE 2010: 813-818 - [c4]Yashodhan Kanoria, Andrea Montanari:
On the deletion channel with small deletion probability. ISIT 2010: 1002-1006 - [c3]Yashodhan Kanoria:
An FPTAS for Bargaining Networks with Unequal Bargaining Powers. WINE 2010: 282-293 - [i5]Yashodhan Kanoria, Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Andrea Montanari:
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks. CoRR abs/1004.2079 (2010) - [i4]Yashodhan Kanoria:
An FPTAS for Bargaining Networks with Unequal Bargaining Powers. CoRR abs/1008.0212 (2010)
2000 – 2009
- 2009
- [i3]Yashodhan Kanoria, Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Andrea Montanari:
A Natural Dynamics for Bargaining on Exchange Networks. CoRR abs/0911.1767 (2009) - [i2]Yashodhan Kanoria, Andrea Montanari:
On the deletion channel with small deletion probability. CoRR abs/0912.5176 (2009) - 2008
- [c2]Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan:
A tight lower bound for parity in noisy communication networks. SODA 2008: 1056-1065 - 2007
- [c1]Yashodhan Kanoria, D. Manjunath:
On Distributed Computation in Noisy Random Planar Networks. ISIT 2007: 626-630 - [i1]Yashodhan Kanoria, D. Manjunath:
On Distributed Computation in Noisy Random Planar Networks. CoRR abs/0712.4059 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
