Log In Sign Up

Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games

by   Francisco J. M. da Silva, et al.

In this paper, we analyze a transportation game first introduced by Fotakis, Gourvès, and Monnot in 2017, where players want to be transported to a common destination as quickly as possible and, in order to achieve this goal, they have to choose one of the available buses. We introduce a sequential version of this game and provide bounds for the Sequential Price of Stability and the Sequential Price of Anarchy in both metric and non-metric instances, considering three social cost functions: the total traveled distance by all buses, the maximum distance traveled by a bus, and the sum of the distances traveled by all players (a new social cost function that we introduce). Finally, we analyze the Price of Stability and the Price of Anarchy for this new function in simultaneous transportation games.


page 1

page 2

page 3

page 4


Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs

We consider an atomic congestion game with stochastic demand in which ea...

Topological Price of Anarchy Bounds for Clustering Games on Networks

We consider clustering games in which the players are embedded in a netw...

Nash equilibria in routing games with edge priorities

In this paper we present a new competitive packet routing model with edg...

Price-Coupling Games and the Generation Expansion Planning Problem

In this paper, we introduce and study a class of games called price-coup...

The Cost of Stability in Coalitional Games

A key question in cooperative game theory is that of coalitional stabili...

Optimising Rule-Based Classification in Temporal Data

This study optimises manually derived rule-based expert system classific...

The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions

We study the efficiency of sequential multiunit auctions with two-buyers...