Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma

Similar documents
Paid Prioritization and Its Impact on Net Neutrality

Strategic Properties of Heterogeneous Serial Cost Sharing

Advanced Microeconomics

arxiv: v2 [cs.ni] 8 Apr 2014

arxiv: v2 [cs.ni] 13 Jun 2017

Zero-rating of Content and its Effect on the Quality of Service in the Internet

Topics in Data Mining Fall Bruno Ribeiro

Content Pricing in Peer-to-Peer Networks

On Hotelling s Stability in Competition

EC487 Advanced Microeconomics, Part I: Lecture 5

Potential Games. Krzysztof R. Apt. CWI, Amsterdam, the Netherlands, University of Amsterdam. Potential Games p. 1/3

Performance Evaluation of Queuing Systems

Wireless Network Pricing Chapter 6: Oligopoly Pricing

Queueing Systems: Lecture 6. Lecture Outline

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016

arxiv: v1 [cs.ni] 10 Jun 2014

The Value of Sharing Intermittent Spectrum

Traffic Games Econ / CS166b Feb 28, 2012

Price setting on a network

Dynamic Service Placement in Geographically Distributed Clouds

Industrial Organization, Fall 2011: Midterm Exam Solutions and Comments Date: Wednesday October

Microeconomic Algorithms for Flow Control in Virtual Circuit Networks (Subset in Infocom 1989)

Efficiency and Braess Paradox under Pricing

Addendum to: Dual Sales Channel Management with Service Competition

Ergodicity and Non-Ergodicity in Economics

Routing Games : From Altruism to Egoism

Algorithmic Game Theory. Alexander Skopalik

Deceptive Advertising with Rational Buyers

Fair and Efficient User-Network Association Algorithm for Multi-Technology Wireless Networks

Oligopoly. Oligopoly. Xiang Sun. Wuhan University. March 23 April 6, /149

Chapter 5. Transmission networks and electricity markets

Internet Peering, Capacity and Pricing

Dynamic Bertrand and Cournot Competition

Vertical Product Differentiation and Credence Goods: Mandatory Labeling and Gains from International Integration

Asymptotics of Efficiency Loss in Competitive Market Mechanisms

Microeconomics Qualifying Exam

Static (or Simultaneous- Move) Games of Complete Information

A Note of Caution on Using Hotelling Models in Platform Markets

Outline for today. Stat155 Game Theory Lecture 17: Correlated equilibria and the price of anarchy. Correlated equilibrium. A driving example.

Answer Key: Problem Set 3

4. Partial Equilibrium under Imperfect Competition

Classic Oligopoly Models: Bertrand and Cournot

Flow Control, Routing, and Performance with a For-profit Service Provider

Numerical illustration

Vertical Di erentiation With Congestion E ect

Oligopoly Theory. This might be revision in parts, but (if so) it is good stu to be reminded of...

Competitive Equilibrium

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign

Econometric Analysis of Games 1

First-Best Dynamic Assignment of Commuters with Endogenous Heterogeneities in a Corridor Network

6.207/14.15: Networks Lecture 24: Decisions in Groups

Equilibrium solutions in the observable M/M/1 queue with overtaking

Strategic Games: Social Optima and Nash Equilibria

Homework 1 - SOLUTION

Non-Neutrality Pushed by Big Content Providers

1 Oligopoly: Bertrand Model

Area I: Contract Theory Question (Econ 206)

SURPLUS SHARING WITH A TWO-STAGE MECHANISM. By Todd R. Kaplan and David Wettstein 1. Ben-Gurion University of the Negev, Israel. 1.

Wireless Internet Exercises

Are innocuous Minimum Quality Standards really innocuous?

Yale University Department of Computer Science

Efficiency Loss in a Network Resource Allocation Game

Bertrand Model of Price Competition. Advanced Microeconomic Theory 1

Stochastic Equilibrium Problems arising in the energy industry

Using Piecewise-Constant Congestion Taxing Policy in Repeated Routing Games

Efficient Mechanism Design

Robust Predictions in Games with Incomplete Information

Price and Capacity Competition

Competition Policy - Spring 2005 Monopolization practices I

Retailer s product line choice with manufacturer s multi-channel marketing

Mechanism Design for Network Decongestion: Rebates and Time-of-Day Pricing

On Decentralized Incentive Compatible Mechanisms for Partially Informed Environments

NBER WORKING PAPER SERIES PRICE AND CAPACITY COMPETITION. Daron Acemoglu Kostas Bimpikis Asuman Ozdaglar

Design Patent Damages under Sequential Innovation

MS&E 246: Lecture 18 Network routing. Ramesh Johari

Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities

Oligopoly Theory 2 Bertrand Market Games

arxiv: v2 [cs.ni] 16 Jun 2009

Price Competition with Elastic Traffic

Fundamental Theorems of Welfare Economics

EC476 Contracts and Organizations, Part III: Lecture 2

Welfare consequence of asymmetric regulation in a mixed Bertrand duopoly

A Stackelberg Network Game with a Large Number of Followers 1,2,3

EQUILIBRIUM STRATEGIES IN AN M/M/1 QUEUE WITH SETUP TIMES AND A SINGLE VACATION POLICY

Cournot and Bertrand Competition in a Differentiated Duopoly with Endogenous Technology Adoption *

Fall 2017 Recitation 9 Notes

Competitive Management of Non-Preemptive Queues with Multiple Values

A Unified Framework for Monetary Theory and Policy Analysis

In the Name of God. Sharif University of Technology. Microeconomics 1. Graduate School of Management and Economics. Dr. S.

Mathematical Economics - PhD in Economics

Industrial Organization II (ECO 2901) Winter Victor Aguirregabiria. Problem Set #1 Due of Friday, March 22, 2013

Managing Call Centers with Many Strategic Agents

Hybrid Pricing for Mobile Collaborative Internet Access

The Price of Anarchy in Parallel - Serial Competition with Elastic Demand

arxiv: v1 [math.oc] 28 Jun 2016

Bayes Correlated Equilibrium and Comparing Information Structures

The priority option: the value of being a leader in complete and incomplete markets.

INVESTMENT IN TWO-SIDED MARKETS AND THE NET NEUTRALITY DEBATE

Introduction to Game Theory

Correlated Equilibrium in Games with Incomplete Information

Transcription:

Congestion Equilibrium for Differentiated Service Classes Richard T. B. Ma School of Computing National University of Singapore Allerton Conference 2011

Outline Characterize Congestion Equilibrium Modeling Differentiated Service Classes Solve Congestion Equilibrium Applications

Competitive Market Equilibrium In a competitive economy, buyers decide how much to buy and producers decide how much to produce A market competitive equilibrium is characterized by price Higher prices induce lower demand/consumption Higher prices induce higher supply/production Prices can be thought of indicators of congestion in system a congestion equilibrium generalization

An Internet Ecosystem Model Three parties system (M, μ, N): 1) Content Providers (CPs), 2) ISPs, and 3) Consumers. μ : capacity of a bottleneck ISP. λ i : throughput rate of CP i N. M : number of end customers using the ISP.

What drives traffic demands? User drives traffic rates from the CPs. User demand depends on the level of system congestion denoted as Γ Given a fixed congestion Γ, we characterize λ i M, μ, N = λ i Γ = α i Mρ i (Γ) Assumption 1: ρ i ( ) is non-negative, continuous and non-increasing on 0, θ i with ρ i 0 = θ i and lim Γ ρ i Γ = 0

Unconstrained Demand θ i Goggle Search Search Page 20 KB Search Time.25 sec Unconstrained demand 600 KBps Netflix HD quality Stream Unconstrained demand 6 MBps

Interpretation of ρ i ( ) λ i Γ = α i Mρ i (Γ) α i is the % of users that are interested in content of CP i. ρ i (Γ) can be interpreted as the per-user achievable throughput rate, which can be written as ρ i Γ = d i Γ θ i Γ, where θ i Γ [0, θ i ], is the throughput of an active user and d i Γ [0,1] is the % of users that are active under Γ.

What affects congestion Γ? Let Λ = (λ 1,, λ N ) be the rates of the CPs. Γ of system (M, μ, N) is characterized by Throughput rates Λ and system capacity μ Higher throughput induces severer congestion Larger capacity relieves congestion Assumption 2: For any μ 1 μ 2 and Λ 1 Λ 2, Γ( ) is a continuous function that satisfies Γ Λ, μ 1 Γ Λ, μ 2 and Γ Λ 1, μ Γ Λ 2, μ.

Unique Congestion Equilibrium Definition: A pair Λ, Γ is a congestion equilibrium of the system (M, μ, N) if λ i M, μ, N = α i Mρ i Γ i N and Γ = Γ(Λ, μ) Theorem 1: Under assumption 1 and 2, system (M, μ, N) has a unique congestion equilibrium. Intuition: A1: decreasing monotonicity of demand A2: increasing monotonicity of congestion System balances at a unique level of congestion

Further Characterization Assumption 3 (Independent of Scale): Γ Λ, μ = Γ ξλ, ξμ ξ > 0. Theorem 2: Under assumption 1 to 3, if Λ, μ is the unique equilibrium of M, μ, N, then for any ξ > 0, ξλ, μ is the unique equilibrium of ξm, ξμ, N. Equilibrium Λ, Γ can be expressed as a function of the per capita capacity ν μ M.

Equilibrium as a Function of ν Congestion in equilibrium Γ N M, μ Γ M, μ, N is a homogenous function of degree 0, i.e. Γ N ν = Γ N ξm, ξμ ξ > 0. ν is a continuous non-increasing function of ν that satisfies Γ N1 ν Γ N2 ν N 1 N 2. Γ N Rates in equilibrium Λ N M, μ Λ M, μ, N is a homogenous function of degree 1, i.e. Λ N M, μ = ξ 1 Λ N ξm, ξμ ξ > 0.

Interpretations of Congestion The concept of congestion is very broad depends on the system resource mechanism can be functions of delay, throughput and etc. 1. System mechanism: M/M/1, FIFO queue; Congestion metric: queueing delay; Γ Λ, μ = Γ N = 1 μ λ N

Interpretations of Congestion 2. System mechanism: Proportional rate control, i.e. θ i : θ j = θ i : θ j for all i, j N; Congestion metric: throughput ratio; Γ Λ, μ = Γ N = θ i θ i 1 i N 3. System mechanism: End-to-end congestion control, e.g. max-min fair mechanism; Congestion metric: function of throughput; Γ Λ, μ = Γ N = 1 max{θ i : i N}

PMP-like Differentiations κ percentage of capacity dedicated to premium content providers c per unit traffic charge for premium content Capacity Charge Premium Class κμ $c /unit traffic Ordinary Class (1 κ)μ $0

Two-stage Game M, μ, N, I Players: ISP I and the set of CPs N Strategies: ISP chooses a strategy s I = (k, c). CPs choose service classes with sn = (O, P). Rules: 1 st stage, ISP announces s I. 2 nd stage, CPs simultaneously reach a joint decision sn. Outcome: set P of CPs shares capacity km and set O of CPs share capacity (1- k)m.

Payoffs (Surplus) Content Provider Payoff: v u i λ i = i λ i (v i c)λ i if i O, if i P. ISP Payoff: c i P λ i = cλ P Consumer Surplus: i N φ i λ i

CPs strategy Choose which service class to join Congestion-taking assumption: Competitive congestion equilibrium in each service class Capacity k m Charge $c /unit traffic (1-k) m $0

Best response, Nash equilibrium Lemma: Given O, P, CP i s best response to join the premium service class if v i c ρ i Γ P i κν v i ρ i Γ O i 1 κ ν. Nash equilibrium: v i c v i ρ i Γ O 1 κ ν ρ i Γ P {i} κν > ρ i Γ O {i} 1 κ ν ρ i Γ P κν if i O, if i P.

Competitive equilibrium vs Nash Under the congestion-taking assumption: Competitive equilibrium: v i c v i > ρ i Γ O 1 κ ν ρ i Γ P κν if i O, if i P. Advantages of competitive equilibrium: Does not assume common knowledge Like the price-taking assumption, valid for large number of players (CPs)

Solving Competitive Equilibrium Each CP has a binary choice, state space size is 2 N, exhaustive search not feasible If for any Γ 1 and Γ 2, ρ i satisfies ρ i Γ 1 ρ i Γ 2 = F i G Γ 1, Γ 2, where F i is continuous and invertible Sort the CPs by F i 1 ( v i c v i ) and use binary search to find a competitive equilibrium

Solving Competitive Equilibrium A general searching method in the congestion space Initialize at step 0, assume the congestion in service classes to be Γ[0] = Γ O 0, Γ P 0. At step t, take previous congestion Γ[t 1], calculate induced equilibrium (O t, P t ). Update the congestion level Γ[t] based on the previous estimate Γ[t 1] and the induced congestion level (Γ O t, Γ P t ).

Finding competitive equilibrium 1. Initialize Γ[0] = Γ 0 O, Γ 0 P ; t = 0; 2. Calculate induced equilibrium (O 0, P 0 ); 3. Do 4. Γ t = (Γ O t, Γ P t ) ; 5. Γ t + 1 = Γ t + g[t] Γ t Γ t ; 6. t = t + 1; 7. Calculate the induced equilibrium (O t, P t ); 8. Until t > T or O t, P t == (O t 1, P t 1 ); 9. Return O t, P t ; Parameters: gain g[t] and maximum steps T.

Applications Congestion equilibrium serves a building block of more complicated game models Analyze strategic behavior of a monopolistic ISP Analyze strategic behavior of ISPs under oligopolistic competition Compare social welfare under different policy regime, e.g. Network Neutrality Vs. non neutral policies.