Search Results for author:
Found 4 papers, 1 papers with code
Catch Me If You Can: Combatting Fraud in Artificial Currency Based Government Benefits Programs
To address the problem of misreporting fraud in artificial currency based benefits programs, we introduce an audit mechanism that induces a two-stage game between an administrator and users.
Differentially Private Stochastic Convex Optimization for Network Routing Applications
In this paper, we present a differentially private algorithm for network routing problems.
Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment
To address the inherent unfairness of SO routing, we study the ${\beta}$-fair SO problem whose goal is to minimize the total travel time while guaranteeing a ${\beta\geq 1}$ level of unfairness, which specifies the maximum possible ratio between the travel times of different users with shared origins and destinations.
Robust and Adaptive Planning under Model Uncertainty
The first, RAMCP-F, converges to an optimal risk-sensitive policy without having to rebuild the search tree as the underlying belief over models is perturbed.
