The price of anarchy in loss systems

Author(s):  
Shoshana Anily ◽  
Moshe Haviv
2003 ◽  
Vol 14 (2) ◽  
pp. 107-118 ◽  
Author(s):  
Harro L. Hartmann ◽  
Martin Knoke

2015 ◽  
Vol 43 (2) ◽  
pp. 16-18 ◽  
Author(s):  
Brendan Patch ◽  
Thomas Taimre ◽  
Yoni Nazarathy
Keyword(s):  

Author(s):  
Aleksandr Belov ◽  
Konstantinos Mattas ◽  
Michail Makridis ◽  
Monica Menendez ◽  
Biagio Ciuffo

Author(s):  
M'hamed Outanoute ◽  
Hamid Garmani ◽  
Mohamed Baslam ◽  
Rachid El Ayachi ◽  
Belaid Bouikhalene

In internet market, content providers (CPs) continue to play a primordial role in the process of accessing different types of data. Competition in this area is fierce; customers are looking for providers that offer them good content (credibility of content and quality of service) with a reasonable price. In this work, the authors analyze this competition between CPs and the economic influence of their strategies on the market. The authors formulate their problem as a non-cooperative game among multiple CPs for the same market. Through a detailed analysis, the researchers prove uniqueness of a pure Nash Equilibrium (NE). Furthermore, a fully distributed algorithm to converge on the NE point is presented. In order to quantify how efficient the NE point is, a detailed analysis of the Price of Anarchy (PoA) is adopted to ensure the performance of the system at equilibrium. Finally, an extensive numerical study is provided to describe the interactions between CPs and to point out the importance of quality of service (QoS) and credibility of content in the market.


2015 ◽  
Vol 47 (03) ◽  
pp. 761-786 ◽  
Author(s):  
Jose Blanchet ◽  
Jing Dong

We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss systems. We use a variation of dominated coupling from the past. We first simulate a stationary infinite server system backwards in time and analyze the running time in heavy traffic. In particular, we are able to simulate stationary renewal marked point processes in unbounded regions. We then use the infinite server system as an upper bound process to simulate the loss system. The running time analysis of our perfect sampling algorithm for loss systems is performed in the quality-driven (QD) and the quality-and-efficiency-driven regimes. In both cases, we show that our algorithm achieves subexponential complexity as both the number of servers and the arrival rate increase. Moreover, in the QD regime, our algorithm achieves a nearly optimal rate of complexity.


Significance ◽  
2013 ◽  
Vol 10 (3) ◽  
pp. 25-30 ◽  
Author(s):  
Brian Skinner ◽  
Brad Carlin
Keyword(s):  

Author(s):  
Erhan Bayraktar ◽  
Yuchong Zhang

We analyze a mean field tournament: a mean field game in which the agents receive rewards according to the ranking of the terminal value of their projects and are subject to cost of effort. Using Schrödinger bridges we are able to explicitly calculate the equilibrium. This allows us to identify the reward functions which would yield a desired equilibrium and solve several related mechanism design problems. We are also able to identify the effect of reward inequality on the players’ welfare as well as calculate the price of anarchy.


Sign in / Sign up

Export Citation Format

Share Document