Xi Jing

dblp:352/6640 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 75% Approximation and online algorithms · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
dynamic pricing
0.712023
Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory · ICDE 2023
Approximation and online algorithms
online learning
0.712023
Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory · ICDE 2023
Algorithmic game theory and mechanism design › dynamic pricing
online pricing
0.712023
Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory · ICDE 2023
Algorithmic game theory and mechanism design
regret minimization
0.712023
Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory · ICDE 2023

Methods — techniques the papers use, named apart from their topics

strategy selection · 0.7online learning · 0.7
YearPublicationVenuePosition
2023 Online Shipping Container Pricing Strategy Achieving Vanishing Regret with Limited Inventory
abstract
With the growing demand for global trade transportation, the shipping container market has gained an increasingly important position. As a key issue of the market, container pricing is regarded as an important indicator to adjust the market supply and demand as well as the revenue of liner enterprises. Although various methods aimed at increasing enterprise revenue, such as expert pricing and dynamic pricing, have been proposed by industry and academia in recent years, these approaches rarely yield worst-case performance guarantee for the double-sided online scenarios of commodities and buyers.To cater to the double-sided online scenario and provide theoretical performance guarantee, we propose an online learning-based pricing framework named Balancing Inventory and Revenue with -chasing Decider (BIRD). BIRD determines container price by combining advantages of given multiple online pricing strategies. We utilize a strategy selector A to select a proper target strategy and use an ϵ-chasing decider ${{{\mathfrak{D}}}^{Cha\operatorname{s} ing}}$ to determine the price. BIRD is proven to combine the advantages of multiple online pricing strategies to achieve the performance close to the posterior optimal strategy for any sequence of online buyers on realistic sales platforms with inventory limitation. BIRD is proved to yield a vanishing regret for the online posted pricing problem with the features of limited inventory and multi-unit demand. Based on the historical data provided by COSCO, one of the largest liner enterprises in the world, we experimentally demonstrate the effectiveness of the proposed algorithm.
Yucen Gao, Xikai Wei, Xi Jing, Yangguang Shi, Xiaofeng Gao 0001, Guihai Chen
ICDE3