No open-access location is known for this record yet.
No open-access location is known for this record yet.
Akamatsu, Sato, and Nguyen (2006) and Akamatsu, 2007a, Akamatsu, 2007b proposed a new dynamic traffic congestion control scheme—the tradable network permit—and proved its efficiency properties for general road networks. To implement tradable permit markets successfully, this paper proposes a novel auction mechanism with capacity control. Assuming that each user makes a trip from an origin to a destination along a path in a specific time period, we design an auction mechanism that enables each user to purchase a bundle of network permits corresponding to a set of links in the user's preferred path. The proposed mechanism employs an evolutionary approach to achieve a dynamic system optimal allo- cation of network permits in a computationally efficient manner. Specifically, it is a hybrid mechanism that consistently combines an auction mechanism with a path capacity control, which are repeated on a day-to-day basis. The former phase involves selling bundles of permits, and the latter phase involves adjusting of the number of the bundles, which corresponds to the path capacities. We prove that the proposed mechanism has the following desirable properties: (i) truthful bidding is the dominant strategy for each user on each day; and (ii) the permit allocation pattern under the mechanism converges to an approximate dynamic system optimal allocation pattern in the sense that the achieved so- cial surplus reaches its maximum value when the number of users is large. Furthermore, we show that the proposed mechanism can be extended to obviate path enumeration by introducing a column generation procedure.
Loading…
Stored only when both papers are in the corpus — 13 citations exist upstream.
Papers that cite the same references — the relational fallback while embeddings are still backfilling.
Imported from OpenAlex (CC0) — nothing here is generated.