A Matching Mechanism with Anticipatory Tolls for Congestion Pricing

02/12/2020
by   J Ceasar Aguma, et al.
0

This paper presents a matching mechanism for assigning drivers to routes where the drivers pay a toll for the marginal delay they impose on other drivers. The simple matching mechanism is derived from the RANKING algorithm for online bipartite matching proposed by Karp et al. [8]. The toll, which is anticipatory in design, is an adaption of one proposed by Dong et al. [5]. Our research proves that the matching mechanism proposed here is pareto user-optimal and can be adapted to give network optimal results for the minimizing total social cost of travel.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2020

A Simple 1-1/e Approximation for Oblivious Bipartite Matching

We study the oblivious matching problem, which aims at finding a maximum...
research
03/24/2022

Online Bipartite Matching via Smoothness

The analysis of online bipartite matching of Eden et al. (2021) is a smo...
research
12/08/2021

Online Elicitation of Necessarily Optimal Matchings

In this paper, we study the problem of eliciting preferences of agents i...
research
02/18/2021

A Stronger Impossibility for Fully Online Matching

We revisit the fully online matching model (Huang et al., J. ACM, 2020),...
research
04/06/2020

Dynamic Ridesharing in Peak Travel Periods

In this paper, we study a variant of the dynamic ridesharing problem wit...

Please sign up or login with your details

Forgot password? Click here to reset