Shrisha Rao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shrisha Rao has a total of 219 co-authors. Here are the top co-authors by number of shared publications:
- Akshay Narayan
National University of Singapore, Singapore
6 shared publications - Guillermo Alberto Perez
University of Antwerp
6 shared publications Nidhi Singh
International Institute of Information Technology-Bangalore (IIIT-B), Bangalore, India
6 shared publications- Abhinandan S. Prasad
Mehta Family School of DS AI, Indian Institute of Technology (IIT), Palakkad, India
5 shared publications - Arun Kumar Kalakanti
International Institute of Information Technology Bangalore, Bengaluru, India
4 shared publications Pragati Agrawal
IIIT Bangalore, Bangalore, India
4 shared publications
Latest Publications
- 1 June 2026
- Published by Elsevier in Advances in Water Resources
- Vol. 214
Multi-scale coupled water–system dynamics under power-law heterogeneity
- 1 June 2026
- Published by Elsevier in Advances in Water Resources
- Vol. 214
Multi-scale coupled water–system dynamics under power-law heterogeneity
- 11 May 2026
- Published by World Scientific Pub Co Pte Ltd in Advances in Complex Systems
- Vol. 29 (03)
QUALITY DYNAMICS IN REGULATED OLIGOPSONY MARKETS WITH REPUTATION SYSTEMS
This paper develops a comprehensive theoretical framework for analyzing quality dynamics in oligopsony markets where numerous producers compete for limited consumer attention under information asymmetries. Motivated by artificial intelligence marketplaces and similar digital platforms, we establish existence and uniqueness conditions for optimal quality provision by heterogeneous producers and prove that posterior reputation estimates converge to accurate quality assessments at rate [ ]. Our analysis demonstrates precision-weighted aggregation optimality and establishes manipulation resistance properties for well-designed information systems. We further prove that consumer loyalty and brand value mechanisms exhibit synergistic quality enhancement effects exceeding simple additive impacts, leading to endogenous market segmentation into premium, specialist, and commodity producer categories when feedback effects are sufficiently strong. The regulatory analysis characterizes welfare-maximizing policy designs and demonstrates strategic complementarity between market-based mechanisms and direct intervention. Our results provide actionable guidance for platform design, showing how integrated governance approaches combining reputation systems, loyalty mechanisms, and appropriately calibrated regulation can enhance market efficiency and quality provision in digital platform environments.
- 11 May 2026
- Published by World Scientific Pub Co Pte Ltd in Advances in Complex Systems
- Vol. 29 (03)
QUALITY DYNAMICS IN REGULATED OLIGOPSONY MARKETS WITH REPUTATION SYSTEMS
This paper develops a comprehensive theoretical framework for analyzing quality dynamics in oligopsony markets where numerous producers compete for limited consumer attention under information asymmetries. Motivated by artificial intelligence marketplaces and similar digital platforms, we establish existence and uniqueness conditions for optimal quality provision by heterogeneous producers and prove that posterior reputation estimates converge to accurate quality assessments at rate [ ]. Our analysis demonstrates precision-weighted aggregation optimality and establishes manipulation resistance properties for well-designed information systems. We further prove that consumer loyalty and brand value mechanisms exhibit synergistic quality enhancement effects exceeding simple additive impacts, leading to endogenous market segmentation into premium, specialist, and commodity producer categories when feedback effects are sufficiently strong. The regulatory analysis characterizes welfare-maximizing policy designs and demonstrates strategic complementarity between market-based mechanisms and direct intervention. Our results provide actionable guidance for platform design, showing how integrated governance approaches combining reputation systems, loyalty mechanisms, and appropriately calibrated regulation can enhance market efficiency and quality provision in digital platform environments.
- Open Access
- 6 May 2026
- Published by Oxford University Press (OUP) in Clean Energy
Accurate Energy Predictions for Optimal Power Flow Problems
This paper investigates how prediction accuracy in renewable energy generation influences the performance of Optimal Power Flow (OPF) in green energy systems. We propose a two-level optimization framework in which the outer level models the OPF problem, while the inner level captures the machine learning--based forecasting task. Because prediction accuracy is inherently multifaceted, we evaluate its impact using several metrics, including root mean squared error, weighted mean squared error (WMSE), and mean bias error. Our formulation incorporates cost components associated with solar curtailment and carbon emissions. The contributions of this work are threefold: (i) we analyze the sensitivity of OPF solutions to prediction errors and derive theoretical bounds on the resulting optimality gap; (ii) we quantify reserve requirements under varying levels of prediction accuracy; and (iii) we present simulations based on real-world data to illustrate system behavior across different accuracy regimes. For example, in a representative case study based on real-world data, increasing forecast RMSE from roughly 200 MW to 480 MW leads to a substantial increase in composite system cost, from a few thousand dollars to several tens of thousands of dollars, highlighting the strong sensitivity of system performance to prediction accuracy. Overall, our results provide both theoretical and empirical guidance on the level of prediction accuracy needed for cost-effective and reliable renewable-integrated energy operation.
- 6 May 2026
- Published by Oxford University Press (OUP) in Clean Energy
Open AccessAccurate Energy Predictions for Optimal Power Flow Problems
This paper investigates how prediction accuracy in renewable energy generation influences the performance of Optimal Power Flow (OPF) in green energy systems. We propose a two-level optimization framework in which the outer level models the OPF problem, while the inner level captures the machine learning--based forecasting task. Because prediction accuracy is inherently multifaceted, we evaluate its impact using several metrics, including root mean squared error, weighted mean squared error (WMSE), and mean bias error. Our formulation incorporates cost components associated with solar curtailment and carbon emissions. The contributions of this work are threefold: (i) we analyze the sensitivity of OPF solutions to prediction errors and derive theoretical bounds on the resulting optimality gap; (ii) we quantify reserve requirements under varying levels of prediction accuracy; and (iii) we present simulations based on real-world data to illustrate system behavior across different accuracy regimes. For example, in a representative case study based on real-world data, increasing forecast RMSE from roughly 200 MW to 480 MW leads to a substantial increase in composite system cost, from a few thousand dollars to several tens of thousands of dollars, highlighting the strong sensitivity of system performance to prediction accuracy. Overall, our results provide both theoretical and empirical guidance on the level of prediction accuracy needed for cost-effective and reliable renewable-integrated energy operation.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 162110-162125
Theoretical Data Rate Limits in Future Wireless Networks: A Simplified Cellular Model
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 162110-162125
Open AccessTheoretical Data Rate Limits in Future Wireless Networks: A Simplified Cellular Model
- 26 October 2025
- Published by Springer Nature
- p. 425-446
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
- 26 October 2025
- Published by Springer Nature
- p. 425-446
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
- Open Access
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1609-1611
Dynamic Pricing for Electric Vehicle Charging
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 1609-1611
Open AccessDynamic Pricing for Electric Vehicle Charging
- Open Access
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
Manipulating downward-closed sets of vectors forms the basis of so-called antichain-based algorithms in verification. In that context, the dimension of the vectors is intimately tied to the size of the input structure to be verified. In this work, we formally analyze the complexity of classical list-based algorithms to manipulate antichains as well as that of Zampuniéris's sharing trees and traditional and novel kdtree-based antichain algorithms. In contrast to the existing literature, and to better address the needs of formal verification, our analysis of \kdtree algorithms does not assume that the dimension of the vectors is fixed. Our theoretical results show that kdtrees are asymptotically better than both list- and sharing-tree-based algorithms, as an antichain data structure, when the antichains become exponentially larger than the dimension of the vectors. We evaluate this on applications in the synthesis of reactive systems from linear-temporal logic and parity-objective specifications, and establish empirically that current benchmarks for these computational tasks do not lead to a favorable situation for current implementations of kdtrees.
Open AccessData Structures for Finite Downsets of Natural Vectors: Theory and Practice
Manipulating downward-closed sets of vectors forms the basis of so-called antichain-based algorithms in verification. In that context, the dimension of the vectors is intimately tied to the size of the input structure to be verified. In this work, we formally analyze the complexity of classical list-based algorithms to manipulate antichains as well as that of Zampuniéris's sharing trees and traditional and novel kdtree-based antichain algorithms. In contrast to the existing literature, and to better address the needs of formal verification, our analysis of \kdtree algorithms does not assume that the dimension of the vectors is fixed. Our theoretical results show that kdtrees are asymptotically better than both list- and sharing-tree-based algorithms, as an antichain data structure, when the antichains become exponentially larger than the dimension of the vectors. We evaluate this on applications in the synthesis of reactive systems from linear-temporal logic and parity-objective specifications, and establish empirically that current benchmarks for these computational tasks do not lead to a favorable situation for current implementations of kdtrees.
- 19 November 2024
- Published by Springer Nature
- p. 134-147
Cooperative Task Execution in Multi-agent Systems
- 19 November 2024
- Published by Springer Nature
- p. 134-147
Cooperative Task Execution in Multi-agent Systems
- 13 November 2024
- Published by Springer Nature
- p. 145-165
Analyzing Value Functions of States in Parametric Markov Chains
- 13 November 2024
- Published by Springer Nature
- p. 145-165
Analyzing Value Functions of States in Parametric Markov Chains
- Open Access
Dynamic Pricing for Electric Vehicle Charging
Dynamic pricing is a promising strategy to address the challenges of smart charging, as traditional time-of-use (ToU) rates and stationary pricing (SP) do not dynamically react to changes in operating conditions, reducing revenue for charging station (CS) vendors and affecting grid stability. Previous studies evaluated single objectives or linear combinations of objectives for EV CS pricing solutions, simplifying trade-offs and preferences among objectives. We develop a novel formulation for the dynamic pricing problem by addressing multiple conflicting objectives efficiently instead of solely focusing on one objective or metric, as in earlier works. We find optimal trade-offs or Pareto solutions efficiently using Non-dominated Sorting Genetic Algorithms (NSGA) II and NSGA III. A dynamic pricing model quantifies the relationship between demand and price while simultaneously solving multiple conflicting objectives, such as revenue, quality of service (QoS), and peak-to-average ratios (PAR). A single method can only address some of the above aspects of dynamic pricing comprehensively. We present a three-part dynamic pricing approach using a Bayesian model, multi-objective optimization, and multi-criteria decision-making (MCDM) using pseudo-weight vectors. To address the research gap in CS pricing, our method selects solutions using revenue, QoS, and PAR metrics simultaneously. Two California charging sites' real-world data validates our approach.
Open AccessDynamic Pricing for Electric Vehicle Charging
Dynamic pricing is a promising strategy to address the challenges of smart charging, as traditional time-of-use (ToU) rates and stationary pricing (SP) do not dynamically react to changes in operating conditions, reducing revenue for charging station (CS) vendors and affecting grid stability. Previous studies evaluated single objectives or linear combinations of objectives for EV CS pricing solutions, simplifying trade-offs and preferences among objectives. We develop a novel formulation for the dynamic pricing problem by addressing multiple conflicting objectives efficiently instead of solely focusing on one objective or metric, as in earlier works. We find optimal trade-offs or Pareto solutions efficiently using Non-dominated Sorting Genetic Algorithms (NSGA) II and NSGA III. A dynamic pricing model quantifies the relationship between demand and price while simultaneously solving multiple conflicting objectives, such as revenue, quality of service (QoS), and peak-to-average ratios (PAR). A single method can only address some of the above aspects of dynamic pricing comprehensively. We present a three-part dynamic pricing approach using a Bayesian model, multi-objective optimization, and multi-criteria decision-making (MCDM) using pseudo-weight vectors. To address the research gap in CS pricing, our method selects solutions using revenue, QoS, and PAR metrics simultaneously. Two California charging sites' real-world data validates our approach.