Ramesh Johari
Professor of Management Science and Engineering and, by courtesy, of Electrical Engineering
Web page: http://web.stanford.edu/people/rjohari
Bio
Johari is broadly interested in the design, economic analysis, and operation of online platforms, as well as statistical and machine learning techniques used by these platforms (such as search, recommendation, matching, and pricing algorithms).
Academic Appointments
-
Professor, Management Science and Engineering
-
Professor (By courtesy), Electrical Engineering
-
Faculty Affiliate, Institute for Human-Centered Artificial Intelligence (HAI)
-
Affiliate, Precourt Institute for Energy
-
Associate Director, Stanford Data Science
-
Member, Stanford Causal Science Center
Honors & Awards
-
George E. Nicholson Student Paper Competition (First Place), INFORMS (2003)
-
Doctoral Dissertation Award (Honorable Mention), ACM (2004)
-
George M. Sprowls Doctoral Dissertation Award, MIT EECS (2004)
-
Management Science and Engineering Graduate Teaching Award, Stanford (2005)
-
Okawa Foundation Research Grant, Okawa Foundation (2005)
-
Telecommunications Dissertation Award, INFORMS (2006)
-
CAREER Award, National Science Foundation (2007)
-
Foundation Award, UPS (2008)
-
Management Science and Engineering Graduate Teaching Award, Stanford (2010)
-
Management Science and Engineering Graduate Teaching Award, Stanford (2017)
-
Best Paper Award, ACM (2018)
Boards, Advisory Committees, Professional Organizations
-
Program co-chair, ACM Economics and Computation (2019 - 2019)
-
Co-creator and co-organizer, Marketplace Innovation Workshop (2015 - 2019)
Professional Education
-
PhD, MIT (2004)
2024-25 Courses
- Fundamentals of Data Science: Prediction, Inference, Causality
MS&E 226 (Aut) -
Independent Studies (19)
- Advanced Reading and Research
CS 499 (Aut, Win, Spr) - Advanced Reading and Research
CS 499P (Aut, Win, Spr) - Curricular Practical Training
CME 390 (Aut, Win, Spr) - Curricular Practical Training
CS 390A (Aut, Win, Spr) - Curricular Practical Training
CS 390B (Aut, Win, Spr) - Curricular Practical Training
CS 390C (Aut, Win, Spr) - Directed Reading and Research
MS&E 408 (Aut, Win, Spr) - Directed Reading in Environment and Resources
ENVRES 398 (Aut, Win, Spr) - Directed Research in Environment and Resources
ENVRES 399 (Aut, Win, Spr) - Independent Project
CS 399 (Aut, Win, Spr) - Independent Project
CS 399P (Aut, Win, Spr) - Independent Work
CS 199 (Aut, Win, Spr) - Independent Work
CS 199P (Aut, Win, Spr) - Part-time Curricular Practical Training
CS 390D (Aut, Win, Spr) - Ph.D. Research
CME 400 (Aut, Win, Spr) - Ph.D. Research Rotation
CME 391 (Aut, Win, Spr) - Programming Service Project
CS 192 (Aut, Win, Spr) - Senior Project
CS 191 (Aut, Win, Spr) - Writing Intensive Senior Research Project
CS 191W (Aut, Win, Spr)
- Advanced Reading and Research
-
Prior Year Courses
2023-24 Courses
- Fundamentals of Data Science: Prediction, Inference, Causality
MS&E 226 (Aut) - Introduction to Game Theory
MS&E 232 (Win) - Topics in Social Data
MS&E 334 (Spr)
2022-23 Courses
- Fundamentals of Data Science: Prediction, Inference, Causality
MS&E 226 (Win) - Introduction to Game Theory
MS&E 232 (Spr)
2021-22 Courses
- Fundamentals of Data Science: Prediction, Inference, Causality
MS&E 226 (Aut) - Senior Project
MS&E 108 (Win)
- Fundamentals of Data Science: Prediction, Inference, Causality
Stanford Advisees
-
Doctoral Dissertation Reader (AC)
Yuchen Hu, Yujin Jeong, Sahasrajit Sarmasarkar, Ravi Sojitra -
Master's Program Advisor
Ely Chen, Sri Donthineni, Connor Hoffmann, Tran Le, Ethan Mehta, Uma Phatak, Daniel Tyshler, Candice Wang, Jianing Wu -
Doctoral (Program)
Orrie Page
All Publications
-
Experimental Design in Two-Sided Platforms: An Analysis of Bias
MANAGEMENT SCIENCE
2022
View details for DOI 10.1287/mnsc.2021.4247
View details for Web of Science ID 000747541300001
-
Teamwork, Targets, Technology, and Tight Control in Newly Diagnosed Type 1 Diabetes: Pilot 4T Study.
The Journal of clinical endocrinology and metabolism
2021
Abstract
CONTEXT: Youth with type 1 diabetes (T1D) do not meet hemoglobin A1c (HbA1c) targets.OBJECTIVE: To assess HbA1c outcomes in children with new onset T1D enrolled in the Teamwork, Targets, Technology and Tight Control (4T) Study.METHOD: HbA1c levels were compared between the 4T and Historical cohorts. HbA1c differences between cohorts were estimated using locally estimated scatter plot smoothing (LOESS). The change from nadir HbA1c (month 4) to 12 months post-diagnosis was estimated by cohort using a piecewise mixed effects regression model accounting for age at diagnosis, sex, ethnicity, and insurance type.SETTING AND PARTICIPANTS: We recruited 135 youth with newly diagnosed T1D at Stanford Children's Health.INTERVENTION: Starting July 2018, all youth within the first month of T1D diagnosis were offered continuous glucose monitoring (CGM) initiation and remote CGM data review was added in March 2019.MAIN OUTCOME MEASURE: HbA1c.RESULTS: HbA1c at 6, 9, and 12 months post-diagnosis was lower in the 4T cohort than in the Historic cohort (-0.54%, -0.52%, and -0.58%, respectively). Within the 4T cohort, HbA1c at 6, 9, and 12 months post-diagnosis was lower in those patients with Remote Monitoring than those without (-0.14%, -0.18%, -0.14%, respectively). Multivariable regression analysis showed that the 4T cohort experienced a significantly lower increase in HbA1c between months 4 and 12 (p < 0.001).CONCLUSIONS: A technology-enabled team-based approach to intensified new onset education involving target setting, CGM initiation, and remote data review significantly decreased HbA1c in youth with T1D 12 months post-diagnosis.
View details for DOI 10.1210/clinem/dgab859
View details for PubMedID 34850024
-
Always Valid Inference: Continuous Monitoring of A/B Tests
OPERATIONS RESEARCH
2021
View details for DOI 10.1287/opre.2021.2135
View details for Web of Science ID 000708967000001
-
Population-level management of Type 1 diabetes via continuous glucose monitoring and algorithm-enabled patient prioritization: Precision health meets population health.
Pediatric diabetes
2021
Abstract
OBJECTIVE: To develop and scale algorithm-enabled patient prioritization to improve population-level management of type 1 diabetes (T1D) in a pediatric clinic with fixed resources, using telemedicine and remote monitoring of patients via continuous glucose monitor (CGM) data review.RESEARCH DESIGN AND METHODS: We adapted consensus glucose targets for T1D patients using CGM to identify interpretable clinical criteria to prioritize patients for weekly provider review. The criteria were constructed to manage the number of patients reviewed weekly and identify patients who most needed provider contact. We developed an interactive dashboard to display CGM data relevant for the patients prioritized for review.RESULTS: The introduction of the new criteria and interactive dashboard was associated with a 60% reduction in the mean time spent by diabetes team members who remotely and asynchronously reviewed patient data and contacted patients, from 3.2±0.20 to 1.3±0.24minutes per patient per week. Given fixed resources for review, this corresponded to an estimated 147% increase in weekly clinic capacity. Patients who qualified for and received remote review (n=58) have associated 8.8 percentage points (pp) (95% CI=0.6-16.9pp) greater time-in-range (70-180mg/dL) glucoses compared to 25 control patients who did not qualify at twelve months after T1D onset.CONCLUSIONS: An algorithm-enabled prioritization of T1D patients with CGM for asynchronous remote review reduced provider time spent per patient and was associated with improved time-in-range. This article is protected by copyright. All rights reserved.
View details for DOI 10.1111/pedi.13256
View details for PubMedID 34374183
-
Managing Congestion in Matching Markets
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
2021; 23 (3): 620-636
View details for DOI 10.1287/msom.2020.0927
View details for Web of Science ID 000653675200007
-
Designing Informative Rating Systems: Evidence from an Online Labor Market
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
2021; 23 (3): 589-605
View details for DOI 10.1287/msom.2020.0921
View details for Web of Science ID 000653675200005
-
Matching While Learning
OPERATIONS RESEARCH
2021; 69 (2): 655–81
View details for DOI 10.1287/opre.2020.2013
View details for Web of Science ID 000631703600016
-
Studying Undergraduate Course Consideration at Scale
AERA OPEN
2021; 7
View details for DOI 10.1177/2332858421991148
View details for Web of Science ID 000620611500001
-
Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach
OPERATIONS RESEARCH
2021; 69 (1): 315–30
View details for DOI 10.1287/opre.2020.1995
View details for Web of Science ID 000615320600020
-
Multi-Service Battery Operation with Cloud Electricity Storage
IEEE. 2020
View details for Web of Science ID 000679246600133
-
Adaptive Experimental Design with Temporal Interference: A Maximum Likelihood Approach
NEURAL INFORMATION PROCESSING SYSTEMS (NIPS). 2020
View details for Web of Science ID 000627697000035
-
Competition and Efficiency of Coalitions in Cournot Games With Uncertainty
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS
2019; 6 (2): 884–96
View details for DOI 10.1109/TCNS.2018.2880302
View details for Web of Science ID 000469874200037
-
Semi-Parametric Dynamic Contextual Pricing
NEURAL INFORMATION PROCESSING SYSTEMS (NIPS). 2019
View details for Web of Science ID 000534424302037
-
Optimal Testing in the Experiment-rich Regime
MICROTOME PUBLISHING. 2019: 626–33
View details for Web of Science ID 000509687900065
-
Designing Optimal Binary Rating Systems
MICROTOME PUBLISHING. 2019
View details for Web of Science ID 000509687901101
-
Bandit Learning with Positive Externalities
NEURAL INFORMATION PROCESSING SYSTEMS (NIPS). 2018
View details for Web of Science ID 000461823304089
-
On Learning the c mu Rule in Single and Parallel Server Networks
IEEE. 2018: 153–54
View details for Web of Science ID 000461021200022
-
Pricing and referrals in diffusion on networks
GAMES AND ECONOMIC BEHAVIOR
2017; 104: 568–94
View details for DOI 10.1016/j.geb.2017.05.011
View details for Web of Science ID 000408296200034
-
The Importance of Exploration in Online Marketplaces
IEEE INTERNET COMPUTING
2016; 20 (1): 20-26
View details for Web of Science ID 000367944200004
-
Competition and Coalition Formation of Renewable Power Producers
IEEE TRANSACTIONS ON POWER SYSTEMS
2015; 30 (3): 1624-1632
View details for DOI 10.1109/TPWRS.2014.2385869
View details for Web of Science ID 000353641000054
-
Equilibria of dynamic games with many players: Existence, approximation, and market structure
JOURNAL OF ECONOMIC THEORY
2015; 156: 269-316
View details for DOI 10.1016/j.jet.2013.07.002
View details for Web of Science ID 000349728700010
-
Can I Take a Peek? Continuous Monitoring of Online A/B Tests
ASSOC COMPUTING MACHINERY. 2015: 915
View details for DOI 10.1145/2740908.2743061
View details for Web of Science ID 000382666600213
-
Mean Field Equilibria of Dynamic Auctions with Learning
MANAGEMENT SCIENCE
2014; 60 (12): 2949-2970
View details for DOI 10.1287/mnsc.2014.2018
View details for Web of Science ID 000346204900005
-
Information Aggregation and Allocative Efficiency in Smooth Markets
MANAGEMENT SCIENCE
2014; 60 (10): 2509-2524
View details for DOI 10.1287/mnsc.2014.1929
View details for Web of Science ID 000343421800009
-
A Buffer-Based Approach to Rate Adaptation: Evidence from a Large Video Streaming Service
SIGCOMM Conference
ASSOC COMPUTING MACHINERY. 2014: 187–98
View details for DOI 10.1145/2619239.2626296
View details for Web of Science ID 000350564600039
-
Mean Field Equilibrium in Dynamic Games with Strategic Complementarities
OPERATIONS RESEARCH
2013; 61 (4): 971-989
View details for DOI 10.1287/opre.2013.1192
View details for Web of Science ID 000323931800013
-
Dynamics in tree formation games
GAMES AND ECONOMIC BEHAVIOR
2013; 79: 1-29
View details for DOI 10.1016/j.geb.2013.01.002
View details for Web of Science ID 000317711400001
-
Mean Field Equilibria of Multi Armed Bandit Games
50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
IEEE. 2013: 1110–1110
View details for Web of Science ID 000320654000151
- Economic Modeling in Networking: A Primer. Foundations and Trends in Networking NOW Publishers.. 2013: 1
-
Heavy Traffic Approximation of Equilibria in Resource Sharing Games
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
2012; 30 (11): 2200-2209
View details for DOI 10.1109/JSAC.2012.121212
View details for Web of Science ID 000311673200012
-
Traffic Engineering With Semiautonomous Users: A Game-Theoretic Perspective
IEEE-ACM TRANSACTIONS ON NETWORKING
2012; 20 (6): 1938-1949
View details for DOI 10.1109/TNET.2012.2208475
View details for Web of Science ID 000313661000020
- Resource management with semiautonomous users. To appear in IEEE/ACM Transactions on Networking. 2012
- Mean field equilibria of multiarmed bandit games. 2012
- Information and the value of execution guarantees. 2012
-
Mean Field Equilibria of Dynamic Auctions with Learning
SI GECOM EXCHANGES
2011; 10 (3): 10–14
View details for Web of Science ID 000218516100003
-
Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution
IEEE-ACM TRANSACTIONS ON NETWORKING
2011; 19 (5): 1290-1303
View details for DOI 10.1109/TNET.2011.2114898
View details for Web of Science ID 000296014000004
-
Parameterized Supply Function Bidding: Equilibrium and Efficiency
OPERATIONS RESEARCH
2011; 59 (5): 1079-1089
View details for DOI 10.1287/opre.1110.0980
View details for Web of Science ID 000297164900002
-
Competition and contracting in service industries
OPERATIONS RESEARCH LETTERS
2011; 39 (5): 390-396
View details for DOI 10.1016/j.orl.2011.06.011
View details for Web of Science ID 000295712400019
-
How Many Tiers? Pricing in the Internet Transit Market
COMPUTER COMMUNICATION REVIEW
2011; 41 (4): 194-205
View details for DOI 10.1145/2043164.2018459
View details for Web of Science ID 000302124800017
- Heavy traffic approximation of equilibria in resource sharing games. 2011
-
Economic Modeling in Networking: A Primer
FOUNDATIONS AND TRENDS IN NETWORKING
2011; 6 (3): 165–286
View details for DOI 10.1561/1300000011
View details for Web of Science ID 000420146100001
- Committing bandits. 2011
- How many tiers? Pricing in the Internet transit market. 2011
- Mean field equilibria of dynamic auctions with learning. 2011
-
Uncoupled Potentials for Proportional Allocation Markets
50th IEEE Conference of Decision and Control (CDC)/European Control Conference (ECC)
IEEE. 2011: 4479–4484
View details for Web of Science ID 000303506205016
-
Investment and Market Structure in Industries with Congestion
OPERATIONS RESEARCH
2010; 58 (5): 1303-1317
View details for DOI 10.1287/opre.1100.0827
View details for Web of Science ID 000283244800003
-
Designing Aggregation Mechanisms for Reputation Systems in Online Marketplaces
SI GECOM EXCHANGES
2010; 9 (1)
View details for Web of Science ID 000218499400003
-
Optimal Windows for Aggregating Ratings in Electronic Marketplaces
MANAGEMENT SCIENCE
2010; 56 (5): 864-880
View details for DOI 10.1287/mnsc.1090.1145
View details for Web of Science ID 000277653900008
-
Demand-Aware Content Distribution on the Internet
IEEE-ACM TRANSACTIONS ON NETWORKING
2010; 18 (2): 476-489
View details for DOI 10.1109/TNET.2009.2035047
View details for Web of Science ID 000276685300011
-
Information-Theoretic Operating Regimes of Large Wireless Networks
IEEE TRANSACTIONS ON INFORMATION THEORY
2010; 56 (1): 427-437
View details for DOI 10.1109/TIT.2009.2034819
View details for Web of Science ID 000273134100030
- Mean field equilibrium in dynamic games with complementarities. 2010
- Information aggregation in smooth markets. 2010
- Congestible services and network effects. 2010
- Information theoretic operating regimes of large wireless networks. IEEE Transactions on Information Theory 2010; 1 (56): 427-437
- Mean field analysis for large population stochastic games. 2010
-
On Oblivious Equilibrium in Large Population Stochastic Games
49th IEEE Conference on Decision and Control (CDC)
IEEE. 2010: 3117–3124
View details for Web of Science ID 000295049103092
-
Mean Field Equilibrium in Dynamic Games with Complementarities
49th IEEE Conference on Decision and Control (CDC)
IEEE. 2010: 6633–6638
View details for Web of Science ID 000295049107080
-
Network Formation: Bilateral Contracting and Myopic Dynamics
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
2009; 54 (8): 1765-1778
View details for DOI 10.1109/TAC.2009.2024564
View details for Web of Science ID 000268756200003
-
Efficiency of Scalar-Parameterized Mechanisms
43rd Annual Allerton Conference on Communication, Control and Computing
INFORMS. 2009: 823–39
View details for DOI 10.1287/opre.1080.0638
View details for Web of Science ID 000270032800003
-
Supermodular Network Games
47th Annual Allerton Conference on Communication, Control, and Computing
IEEE. 2009: 1369–1376
View details for Web of Science ID 000279627100187
- Network formation: bilateral contracting and myopic dynamics. IEEE Transactions on Automatic Control 2009; 8 (54): 1765-1778
-
Comparing Multilateral and Bilateral Exchange Models for Content Distribution
IEEE Information Theory Workshop on Networking and Information Theory
IEEE. 2009: 145–146
View details for Web of Science ID 000273966100031
-
Traffic Engineering vs. Content Distribution: A Game Theoretic Perspective
IEEE INFOCOM Conference 2009
IEEE. 2009: 540–548
View details for Web of Science ID 000275366200061
-
Traffic Engineering, Content Distribution, and Continuous Potential Games
International Conference on Game Theory for Networks
IEEE. 2009: 98–99
View details for Web of Science ID 000274558900014
-
Oblivious Equilibrium: An Approximation to Large Population Dynamic Games with Concave Utility
International Conference on Game Theory for Networks
IEEE. 2009: 68–69
View details for Web of Science ID 000274558900009
-
A Mean Field Approach to Competition in Large Scale Wireless Systems
MobiHoc S3 Workshop
ASSOC COMPUTING MACHINERY. 2009: 13–15
View details for Web of Science ID 000282529000004
-
Lump-Sum Markets for Air Traffic Flow Control with Competitive Airlines
PROCEEDINGS OF THE IEEE
2008; 96 (12): 2113-2130
View details for DOI 10.1109/JPROC.2008.2006197
View details for Web of Science ID 000262934800015
-
Information Theoretic Operating Regimes of Large Wireless Networks
IEEE International Symposium on Information Theory
IEEE. 2008: 186–190
View details for Web of Science ID 000260364400038
- Local myopic dynamics in network formation games. 2008
- Peer-assisted content distribution with prices. 2008
- Oblivious equilibrium for general stochastic games with unbounded costs. 2008
- Oblivious equilibrium for general stochastic games with concave costs. 2008
- A comparison of bilateral and multilateral exchanges for peer-assisted content distribution. 2008
- Prices are right: aligning incentives for peer-assisted content distribution. 2008
- A comparison of bilateral and multilateral exchanges for peer-assisted content distribution. 2008
-
Local Dynamics for Network Formation Games
46th Annual Allerton Conference on Communication, Control and Computing
IEEE. 2008: 937–938
View details for Web of Science ID 000268229600132
-
Local Two-Stage Myopic Dynamics for Network Formation Games
4th International Workshop on Internet and Network Economics
SPRINGER-VERLAG BERLIN. 2008: 263–277
View details for Web of Science ID 000262046200024
-
Oblivious Equilibrium for Stochastic Games with Concave Utility
46th Annual Allerton Conference on Communication, Control and Computing
IEEE. 2008: 1304–1308
View details for Web of Science ID 000268229600185
-
Oblivious Equilibrium for Large-Scale Stochastic Games with Unbounded Costs
47th IEEE Conference on Decision and Control
IEEE. 2008: 5531–5538
View details for Web of Science ID 000307311605110
-
Implications of autonomy for the expressiveness of policy routing
IEEE-ACM TRANSACTIONS ON NETWORKING
2007; 15 (6): 1266-1279
View details for DOI 10.1109/TNET.2007.896531
View details for Web of Science ID 000252125200005
-
Partially optimal routing
40th Annual Conference on Information Sciences and Systems (CISS)
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2007: 1148–60
View details for DOI 10.1109/JSAC.2007.070809
View details for Web of Science ID 000248352300009
-
Network formation: Bilateral contracting and myopic dynamics
3rd International Workshop on Internet and Network Economics
SPRINGER-VERLAG BERLIN. 2007: 191–207
View details for Web of Science ID 000252182500020
- Efficiency loss and the design of scalable resource allocation mechanisms. Algorithmic Game Theory edited by Nisan, N., Roughgarden, T., Tardos, E. Cambridge University Press: Cambridge, United Kingdom.. 2007: 543–567
- Revenue management for content delivery. 2007
- Network formation: bilateral contracting and myopic dynamics. 2007
- Oblivious equilibrium for general stochastic games with many players. 2007
-
Dynamics and stability in network formation games with bilateral contracts
46th IEEE Conference on Decision and Control
IEEE. 2007: 5871–5878
View details for Web of Science ID 000255181703134
-
A contract-based model for directed network formation
GAMES AND ECONOMIC BEHAVIOR
2006; 56 (2): 201-224
View details for DOI 10.1016/j.geb.2005.08.010
View details for Web of Science ID 000238585500001
-
A scalable network resource allocation mechanism with bounded efficiency loss
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
2006; 24 (5): 992-999
View details for DOI 10.1109/JSAC.2006.872880
View details for Web of Science ID 000237401600006
-
Paradoxes of traffic engineering with partially optimal routing
40th Annual Conference on Information Sciences and Systems (CISS)
IEEE. 2006: 661–667
View details for Web of Science ID 000244721800125
- Positive externalities and optimal scale. 2006
- A peer-to-peer system as an exchange economy. 2006
-
Efficiency-loss in a network resource allocation game: The case of elastic supply
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
2005; 50 (11): 1712-1724
View details for DOI 10.1109/TAC.2005.858687
View details for Web of Science ID 000233442700006
-
Implications of autonomy for the expressiveness of policy routing
SIGCOMM/ACM Conference on Computer Communications
ASSOC COMPUTING MACHINERY. 2005: 25–36
View details for Web of Science ID 000233120000004
-
A game theoretic view of efficiency loss in resource allocation
Symposium on Systems, Control, and Networks
BIRKHAUSER BOSTON. 2005: 203–223
View details for Web of Science ID 000231525400012
- Communication requirements of VCG-like mechanisms in convex environments. 2005
- Efficiency loss in a network resource allocation game: the case of elastic supply. IEEE Transactions on Automatic Control 2005; 11 (50): 1712-1724
-
Efficiency loss in a network resource allocation game
MATHEMATICS OF OPERATIONS RESEARCH
2004; 29 (3): 407-435
View details for Web of Science ID 000224311900001
-
Routing and peering in a competitive Internet
43rd IEEE Conference on Decision and Control
IEEE. 2004: 1556–1561
View details for Web of Science ID 000226745601073
-
Efficiency loss in a resource allocation game: A single link in elastic supply
43rd IEEE Conference on Decision and Control
IEEE. 2004: 4679–4683
View details for Web of Science ID 000226745604028
- Network resource allocation and a congestion game: the single link case. 2003
- End-to-end congestion control for the Internet: delays and stability. IEEE/ACM Transactions on Networking 2001; 6 (9): 818-832