The University of Southampton
University of Southampton Institutional Repository

Optimal network pricing with oblivious users: a new model and algorithm

Optimal network pricing with oblivious users: a new model and algorithm
Optimal network pricing with oblivious users: a new model and algorithm
Traffic modeling is important in modern society. In this work we propose a new model on the optimal network pricing (Onp) with the assumption of oblivious users, in which the users remain oblivious to real-time traffic conditions and others' behavior. Inspired by works on transportation research and network pricing for selfish traffic, we mathematically derive and prove a new formulation of Onp with decision-dependent modeling that relax certain existing modeling constraints in the literature. Then, we express the Onp formulation as a constrained nonconvex stochastic quadratic program with uncertainty, and we propose an efficient algorithm to solve the problem, utilizing graph theory, sparse linear algebra and stochastic approximation. Lastly, we showcase the effectiveness of the proposed algorithm and the usefulness of the new Onp formulation. The proposed algorithm achieves a 5x speedup by exploiting the sparsity structure of the model.
Numerical Analysis, Optimization and Control, 94C15, 90C15, 90C26, 91A14, 90C35, 65F50
arXiv
Li, Yixuan
531af5a1-17a4-41e4-a107-bf2126303981
Ang, Andersen
ed509ecd-39a3-4887-a709-339fdaded867
Stein, Sebastian
cb2325e7-5e63-475e-8a69-9db2dfbdb00b
Li, Yixuan
531af5a1-17a4-41e4-a107-bf2126303981
Ang, Andersen
ed509ecd-39a3-4887-a709-339fdaded867
Stein, Sebastian
cb2325e7-5e63-475e-8a69-9db2dfbdb00b

[Unknown type: UNSPECIFIED]

Record type: UNSPECIFIED

Abstract

Traffic modeling is important in modern society. In this work we propose a new model on the optimal network pricing (Onp) with the assumption of oblivious users, in which the users remain oblivious to real-time traffic conditions and others' behavior. Inspired by works on transportation research and network pricing for selfish traffic, we mathematically derive and prove a new formulation of Onp with decision-dependent modeling that relax certain existing modeling constraints in the literature. Then, we express the Onp formulation as a constrained nonconvex stochastic quadratic program with uncertainty, and we propose an efficient algorithm to solve the problem, utilizing graph theory, sparse linear algebra and stochastic approximation. Lastly, we showcase the effectiveness of the proposed algorithm and the usefulness of the new Onp formulation. The proposed algorithm achieves a 5x speedup by exploiting the sparsity structure of the model.

Text
pdf - Author's Original
Download (1MB)

More information

Published date: 9 October 2025
Keywords: Numerical Analysis, Optimization and Control, 94C15, 90C15, 90C26, 91A14, 90C35, 65F50

Identifiers

Local EPrints ID: 506762
URI: http://eprints.soton.ac.uk/id/eprint/506762
PURE UUID: aca776e9-ae00-4ab0-a251-05f5628acd9a
ORCID for Yixuan Li: ORCID iD orcid.org/0009-0001-3027-8789
ORCID for Andersen Ang: ORCID iD orcid.org/0000-0002-8330-758X
ORCID for Sebastian Stein: ORCID iD orcid.org/0000-0003-2858-8857

Catalogue record

Date deposited: 18 Nov 2025 17:36
Last modified: 20 Nov 2025 03:07

Export record

Altmetrics

Contributors

Author: Yixuan Li ORCID iD
Author: Andersen Ang ORCID iD
Author: Sebastian Stein ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×