Cost-sharing in Parking Games

09/21/2023
by   Jennifer Elder, et al.
0

We introduce parking games, which are coalitional cost-sharing games in characteristic function form derived from the total displacement of parking functions. Motivated by the “fair” distribution of parking costs, our main contribution is a polynomial-time algorithm to compute the Shapley value of these games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2020

Resource-Aware Protocols for Network Cost-Sharing Games

We study the extent to which decentralized cost-sharing protocols can ac...
research
01/27/2021

A Balance for Fairness: Fair Distribution Utilising Physics in Games of Characteristic Function Form

In chaotic modern society, there is an increasing demand for the realiza...
research
08/21/2014

A Study of Proxies for Shapley Allocations of Transport Costs

We propose and evaluate a number of solutions to the problem of calculat...
research
09/10/2019

Fair Sharing: The Shapley Value for Ride-Sharing and Routing Games

Ride-sharing services are gaining popularity and are crucial for a susta...
research
07/07/2021

Capacitated Network Design Games on a Generalized Fair Allocation Model

The cost-sharing connection game is a variant of routing games on a netw...
research
04/18/2023

Connectivity in the presence of an opponent

The paper introduces two player connectivity games played on finite bipa...
research
02/04/2018

Industrial Symbiotic Relations as Cooperative Games

In this paper, we introduce a game-theoretical formulation for a specifi...

Please sign up or login with your details

Forgot password? Click here to reset