Theoretical Steps to Optimize Transportation in the Cubic Networks and the Congestion Paradox

Joonkyung Yoo

Papers from arXiv.org

Abstract: Given a player is guaranteed the same payoff for each delivery path in a single-cube delivery network, the player's best response is to randomly divide all goods and deliver them to all other nodes, and the best response satisfies the Kuhn-Tucker condition. The state of the delivery network is randomly complete. If congestion costs are introduced to the player's maximization problem in a multi-cubic delivery network, the congestion paradox arises where all coordinates become congested as long as the previous assumptions about payoffs are maintained.

Date: 2024-01
New Economics Papers: this item is included in nep-gth, nep-net, nep-tre and nep-ure
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2401.00940 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2401.00940

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators (help@arxiv.org).