A stochastic generalized Nash equilibrium model for platforms competition in the ride-hail market

03/29/2022
by   Filippo Fabiani, et al.
0

The presence of uncertainties in the ride-hailing market complicates the pricing strategies of on-demand platforms that compete each other to offer a mobility service while striving to maximize their profit. Looking at this problem as a stochastic generalized Nash equilibrium problem (SGNEP), we design a distributed, stochastic equilibrium seeking algorithm with Tikhonov regularization to find an optimal pricing strategy. Remarkably, the proposed iterative scheme does not require an increasing (possibly infinite) number of samples of the random variable to perform the stochastic approximation, thus making it appealing from a practical perspective. Moreover, we show that the algorithm returns a Nash equilibrium under mere monotonicity assumption and a careful choice of the step size sequence, obtained by exploiting the specific structure of the SGNEP at hand. We finally corroborate our results on a numerical instance of the on-demand ride-hailing market.

READ FULL TEXT
research
10/25/2019

A damped forward-backward algorithm for stochastic generalized Nash equilibrium seeking

We consider a stochastic generalized Nash equilibrium problem (GNEP) wit...
research
08/22/2020

Competitive ride-sourcing market with a third-party integrator

Recently, some transportation service providers attempt to integrate the...
research
10/12/2022

Zero-Knowledge Optimal Monetary Policy under Stochastic Dominance

Optimal simple rules for the monetary policy of the first stochastically...
research
03/24/2022

Personalized incentives as feedback design in generalized Nash equilibrium problems

We investigate both stationary and time-varying, nonmonotone generalized...
research
06/04/2018

A rational decentralized generalized Nash equilibrium seeking for energy markets

We propose a method to design a decentralized energy market which guaran...
research
03/14/2020

Online Assortment and Market Segmentation under Bertrand Competition with Set-Dependent Revenues

We consider an online assortment problem with [n]:={1,2,...,n} sellers, ...
research
04/30/2018

On incremental deployability

Motivated by the difficulty of effecting fundamental change in the archi...

Please sign up or login with your details

Forgot password? Click here to reset