8,845 research outputs found
Price of Anarchy in Bernoulli Congestion Games with Affine Costs
We consider an atomic congestion game in which each player participates in
the game with an exogenous and known probability , independently
of everybody else, or stays out and incurs no cost. We first prove that the
resulting game is potential. Then, we compute the parameterized price of
anarchy to characterize the impact of demand uncertainty on the efficiency of
selfish behavior. It turns out that the price of anarchy as a function of the
maximum participation probability is a nondecreasing
function. The worst case is attained when players have the same participation
probabilities . For the case of affine costs, we provide an
analytic expression for the parameterized price of anarchy as a function of
. This function is continuous on , is equal to for , and increases towards when . Our work can be interpreted as
providing a continuous transition between the price of anarchy of nonatomic and
atomic games, which are the extremes of the price of anarchy function we
characterize. We show that these bounds are tight and are attained on routing
games -- as opposed to general congestion games -- with purely linear costs
(i.e., with no constant terms).Comment: 29 pages, 6 figure
Incentive Mechanisms for Internet Congestion Management: Fixed-Budget Rebate versus Time-of-Day Pricing
Mobile data traffic has been steadily rising in the past years. This has
generated a significant interest in the deployment of incentive mechanisms to
reduce peak-time congestion. Typically, the design of these mechanisms requires
information about user demand and sensitivity to prices. Such information is
naturally imperfect. In this paper, we propose a \emph{fixed-budget rebate
mechanism} that gives each user a reward proportional to his percentage
contribution to the aggregate reduction in peak time demand. For comparison, we
also study a time-of-day pricing mechanism that gives each user a fixed reward
per unit reduction of his peak-time demand. To evaluate the two mechanisms, we
introduce a game-theoretic model that captures the \emph{public good} nature of
decongestion. For each mechanism, we demonstrate that the socially optimal
level of decongestion is achievable for a specific choice of the mechanism's
parameter. We then investigate how imperfect information about user demand
affects the mechanisms' effectiveness. From our results, the fixed-budget
rebate pricing is more robust when the users' sensitivity to congestion is
"sufficiently" convex. This feature of the fixed-budget rebate mechanism is
attractive for many situations of interest and is driven by its closed-loop
property, i.e., the unit reward decreases as the peak-time demand decreases.Comment: To appear in IEEE/ACM Transactions on Networkin
A computational comparison of two simplicial decomposition approaches for the separable traffic assignment problems : RSDTA and RSDVI
Draft pel 4th Meeting del Euro Working Group on Transportation (Newcastle 9-11 setembre de 1.996)The class of simplicial decomposition methods has shown to constitute efficient tools for the solution of the variational inequality formulation of the general traffic assignment problem. The paper presents a particular implementation of such an algorithm, called RSDVI, and a restricted simplicial decomposition algorithm, developed adhoc for diagonal, separable, problems named RSDTA. Both computer codes are compared for large scale separable traffic assignment problems. Some meaningful figures are shown for general problems with several levels of asymmetry.Preprin
Mean-Field-Type Games in Engineering
A mean-field-type game is a game in which the instantaneous payoffs and/or
the state dynamics functions involve not only the state and the action profile
but also the joint distributions of state-action pairs. This article presents
some engineering applications of mean-field-type games including road traffic
networks, multi-level building evacuation, millimeter wave wireless
communications, distributed power networks, virus spread over networks, virtual
machine resource management in cloud networks, synchronization of oscillators,
energy-efficient buildings, online meeting and mobile crowdsensing.Comment: 84 pages, 24 figures, 183 references. to appear in AIMS 201
- …