scispace - formally typeset
T

Tarun Rambha

Researcher at Indian Institute of Science

Publications -  29
Citations -  282

Tarun Rambha is an academic researcher from Indian Institute of Science. The author has contributed to research in topics: Computer science & Traffic flow. The author has an hindex of 8, co-authored 25 publications receiving 197 citations. Previous affiliations of Tarun Rambha include Cornell University & University of Texas at Austin.

Papers
More filters
Journal ArticleDOI

Network-wide adaptive tolling for connected and automated vehicles

TL;DR: The flexibility of this tolling scheme is demonstrated in three specific traffic modeling contexts with varying traffic flow and user behavior assumptions: a day-to-day pricing model using static network equilibrium with link delay functions; a within-day adaptive Pricing model using the cell transmission model and dynamic routing of vehicles; and a microsimulation of reservation-based intersection control for connected and autonomous vehicles with myopic routing.
Journal ArticleDOI

Dynamic pricing in discrete time stochastic day-to-day route choice models

TL;DR: This paper proposes an average cost Markov decision process model to reduce the expected total system travel time of the logit route choice model using dynamic pricing and develops approximation schemes for handling a large number of users.
Proceedings ArticleDOI

Real-time Adaptive Tolling Scheme for Optimized Social Welfare in Traffic Networks

TL;DR: This paper introduces △-tolling, a novel tolling scheme that is adaptive in real-time and able to scale to large networks, and provides theoretical evidence showing that under certain assumptions ▵-Tolling is equal to Marginal-Cost Tolling, which provably leads to system-optimal, and empirical evidence showing the increase in social welfare in two traffic simulators.

Traffic Optimization For a Mixture of Self-interested and Compliant Agents.

TL;DR: This paper considers a scenario where a centralized network manager wishes to optimize utilities over all agents, i.e., implement a system-optimum routing policy and presents a computationally tractable method that computes the minimal amount of agents that the system manager needs to influence (compliant agents) in order to achieve system optimal performance.
Journal ArticleDOI

Modeling Parking Search on a Network by Using Stochastic Shortest Paths with History Dependence

TL;DR: An asymptotic reset model is proposed that generalizes the full-reset and no-reset cases and uses the concept of reset rate to characterize the temporal dependence of parking probabilities on earlier observations.