Ordinary and prophet planning under uncertainty in Bernoulli congestion games
From MaRDI portal
Publication:6507465
arXiv1903.03309MaRDI QIDQ6507465FDOQ6507465
N. E. Stier-Moses, Marc Schröder, Roberto Cominetti, Marco Scarsini
Abstract: We consider an atomic congestion game in which each player either participates in the game with an exogenous and known probability , independently of everybody else, or stays out and incurs no cost. We compute the parameterized price of anarchy to characterize the impact of demand uncertainty on the efficiency of selfish behavior, considering two different notions of a social planner. A prophet planner knows the realization of the random participation in the game; the ordinary planner does not. As a consequence, a prophet planner can compute an adaptive social optimum that selects different solutions depending on the players that turn out to be active, whereas an ordinary planner faces the same uncertainty as the players and can only compute social optima with respect to the player participation distribution. For both planners, we derive the precise price of anarchy, which arises from an optimization problem parameterized by the maximum participation probability . For the case of affine costs, we provide an analytic expression for the ordinary and prophet price of anarchy, parameterized as a function of .
Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06) (n)-person games, (n>2) (91A06) Games involving graphs (91A43) Stochastic models in economics (91B70) Potential and congestion games (91A14)
This page was built for publication: Ordinary and prophet planning under uncertainty in Bernoulli congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507465)
