Skip to content
Book Open access

Online Joint Pricing and Scheduling in Distributed Networked Platforms

Nov 2026 · Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing · pp. 271-280 · 0 citations · 26 references

TL;DR

This paper proposes a class of parameterized threshold-based posted pricing policies that enable tractable online decision-making with provable performance guarantees, and develops a learning-based approach to improve empirical performance under realistic demand patterns.

Abstract

In distributed networked platforms, such as geographically distributed data centers and electric vehicle charging networks, there are multiple resource providers that can serve user requests arriving sequentially over time. In this paper, we study an online posted pricing problem jointly with scheduling in distributed networked platforms. In such systems, user requests arrive sequentially over time, and each request (if accepted) can be served by one of multiple resource providers. Rather than centrally assigning a provider, the platform posts prices together with corresponding scheduling decisions for all providers, and each user independently selects one option or leaves based on the posted prices and its private valuation. As demand increases, posted pricing and scheduling act as complementary mechanisms for regulating system usage. However, designing effective online posted pricing policies is challenging because of uncertainty in arrivals and the intertemporal coupling across requests, where current pricing decisions affect future feasibility and performance. We propose a class of parameterized threshold-based posted pricing policies that enable tractable online decision-making with provable performance guarantees. We identify a sufficient condition that ensures feasibility and supports competitive analysis, which in turn characterizes a structured policy design space. Building on this structure, we develop a learning-based approach to improve empirical performance under realistic demand patterns. We evaluate our approach on the problem of pricing and scheduling in electric vehicle charging stations using real-world charging traces, and demonstrate that the empirical performance of our algorithm outperforms other benchmark algorithms.

Read PDF

Similar papers

#edge computing Book Open access Nov 2026

Joint Incentive Contract and Assignment Design for Mobile Networked Platforms with Endogenous Supply

This work calibrates the tractable one-period objective using an auxiliary memoryless discounted surrogate, and yields an Equimarginal Principle requiring efficient platforms to equalize the marginal retention efficiency of assignment and contracting.

Yu-Mou Liu, Zhen-Zhe Zheng, Jiang Rong et al. · 0 citations
Preprint Oct 2026

Tight Guarantees for Static Policies in Vehicle Sharing Networks

We study pricing in a vehicle sharing network with $N$ locations and $C$ vehicles, motivated by on-demand bike, scooter, and car sharing, as well as robotaxi and ride sharing services. Customers request directed trips between locations, with travel times following general distributions, and leave without service if no...

Adam N. Elmachtoub, Jia-Qi Shi · 0 citations
Oct 2026

EXPRESS: Pricing and Information Provision in Service Platforms with Heterogeneous Customers

Service platforms frequently employ virtual queues where customers have differing sensitivities to wait times and cannot see their precise positions in line. In these settings, providers often disclose waiting-time information to influence customers' decisions on whether to join or balk. A natural benchmark is to repor...

Xin Weng, Li-Jian Lu, Li Xiao · 0 citations
Open access Oct 2026

A Mechanism Design Approach for Dynamic Task Online Scheduling

In game-theoretic grid computing, selfish users may misreport task information to obtain individual advantages, leading to prolonged scheduling negotiations and degraded system performance. This study aims to develop the resource allocation mechanism for dynamic tasks (RAMDT), an online scheduling mechanism based on th...

Xiao-Peng Lin, Hua-Ching Chen, Hsuan-Ming Feng · 0 citations
Preprint Sep 2026

Arrival-Time Incentive Compatibility in Random Order Online Bipartite Matching

In this work we initiate the study of competitive algorithms with arrival-time incentive compatibility for random-order online bipartite matching in settings where the users care only about receiving service (matched vs. unmatched) and not which offline resource serves them, while the platform's objective is to maximiz...

Arghya Chakraborty, Varun Gupta · 0 citations
Book Open access Nov 2026

Reusable Resource Allocation under Adversarial Arrivals: Learning with Delayed Feedback

We study an online reusable resource allocation problem motivated by mobile edge AI platforms, where sequentially arriving requests must be immediately admitted and assigned to one of multiple edge service options with limited reusable capacities or offloaded to a remote central server. If accepted, a request occupies...

Qing-Song Liu, Mahsa Sahebdel, Ativ Joshi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.