mlsanityData to 14 Oct 2026

Strategic bidding in freight transport using deep reinforcement learning

arXiv 2102.09253 ↗First posted 18 Feb 2021cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

This paper presents a multi-agent reinforcement learning algorithm to represent strategic bidding behavior in freight transport markets. Using this algorithm, we investigate whether feasible market equilibriums arise without any central control or communication between agents. Studying behavior in such environments may serve as a stepping stone towards self-organizing logistics systems like the Physical Internet. We model an agent-based environment in which a shipper and a carrier actively learn bidding strategies using policy gradient methods, posing bid- and ask prices at the individual container level. Both agents aim to learn the best response given the expected behavior of the opposing agent. A neutral broker allocates jobs based on bid-ask spreads. Our game-theoretical analysis and numerical experiments focus on behavioral insights. To evaluate system performance, we measure adherence to Nash equilibria, fairness of reward division and utilization of transport capacity. We observe good performance both in predictable, deterministic settings (~95% adherence to Nash equilibria) and highly stochastic environments (~85% adherence). Risk-seeking behavior may increase an agent's reward share, as long as the strategies are not overly aggressive. The results suggest a potential for full automation and decentralization of freight transport markets.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 40 references that are in the map. First posted on arXiv 18 Feb 2021.

Builds on

3 of 40 references.

References · 3

  1. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  2. 2017The power of deeper networks for expressing natural functionscited by 35
  3. 2020Smart Containers With Bidding Capacity: A Policy Gradient Algorithm for Semi-Cooperative Learningcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.