Incentive Mechanisms for Internet Congestion Management: Fixed-Budget Rebate versus Time-of-Day Pricing
Patrick Loiseau, Galina Schwartz, John Musacchio, Saurabh Amin, S., Shankar Sastry

TL;DR
This paper compares fixed-budget rebate and time-of-day pricing mechanisms for managing internet congestion, demonstrating that the rebate approach is more robust under certain demand sensitivities through a game-theoretic analysis.
Contribution
It introduces a fixed-budget rebate mechanism for congestion management and analyzes its robustness compared to time-of-day pricing using a game-theoretic model.
Findings
Fixed-budget rebate achieves socially optimal decongestion under specific parameters.
Rebate mechanism is more robust with convex user demand sensitivities.
Closed-loop property of rebate mechanism reduces unit reward as demand decreases.
Abstract
Mobile data traffic has been steadily rising in the past years. This has generated a significant interest in the deployment of incentive mechanisms to reduce peak-time congestion. Typically, the design of these mechanisms requires information about user demand and sensitivity to prices. Such information is naturally imperfect. In this paper, we propose a \emph{fixed-budget rebate mechanism} that gives each user a reward proportional to his percentage contribution to the aggregate reduction in peak time demand. For comparison, we also study a time-of-day pricing mechanism that gives each user a fixed reward per unit reduction of his peak-time demand. To evaluate the two mechanisms, we introduce a game-theoretic model that captures the \emph{public good} nature of decongestion. For each mechanism, we demonstrate that the socially optimal level of decongestion is achievable for a specific…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
