“Attractors and Repellors: a Game Theoretic interpretation of the cycles in provider-customer relations” Advanced Workshop on Internet Topology and Economics.

Slides:



Advertisements
Similar presentations
Vincent Conitzer CPS Repeated games Vincent Conitzer
Advertisements

Collusion and Cartels What is collusion? –An attempt to suppress competition What is a cartel? –A group of firms who have agreed explicitly to coordinate.
ECON 100 Tutorial: Week 9 office: LUMS C85.
Utility Theory.
Evolution and Repeated Games D. Fudenberg (Harvard) E. Maskin (IAS, Princeton)
Managerial Economics & Business Strategy
1 Industrial Organization Collusion Univ. Prof. dr. Maarten Janssen University of Vienna Summer semester Week 17.
© 2009 Pearson Education Canada 16/1 Chapter 16 Game Theory and Oligopoly.
Game Theoretical Models of Effort and Lobbying in a Heterogeneous CPR Setting Matthew Freeman Louisiana State University/LA Sea Grant Chris Anderson University.
Infinitely Repeated Games. In an infinitely repeated game, the application of subgame perfection is different - after any possible history, the continuation.
Non-Cooperative Game Theory To define a game, you need to know three things: –The set of players –The strategy sets of the players (i.e., the actions they.
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
M9302 Mathematical Models in Economics Instructor: Georgi Burlakov 2.5.Repeated Games Lecture
EC3224 Autumn Lecture #04 Mixed-Strategy Equilibrium
EC941 - Game Theory Lecture 7 Prof. Francesco Squintani
Game Theory: Inside Oligopoly
Game Theory Lecture 9.
Internet Economics: the use of Shapley value for ISP settlement Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
This paper reports an experimental study based on the popular Chinos game, in which three players, arranged in sequence, have to guess the total number.
Industrial Organization - Matilde Machado Tacit Collusion Tacit Collusion Matilde Machado.
The Core A Methodological Toolkit to Reform Payment Systems Game Theory World Bank, Washington DC, November 5th, 2003.
© 2005 Pearson Education Canada Inc Chapter 16 Game Theory and Oligopoly.
A camper awakens to the growl of a hungry bear and sees his friend putting on a pair of running shoes, “You can’t outrun a bear,” scoffs the camper. His.
Ten Years in the Evolution of the Internet Ecosystem
Objectives © Pearson Education, 2005 Oligopoly LUBS1940: Topic 7.
NEIGHBORHOOD EFFECTS BY Steven N. Durlauf Ania Bonarska & Okafor Luke Emeka Development Workshop, 2007.
APEC 8205: Applied Game Theory Fall 2007
QR 38 3/20/07, More on repeated games in IR I.Folk theorem II.Other solutions to the PD III.Repeated PDs in practice.
Repeated games - example This stage game is played 2 times Any SPNE where players behave differently than in a 1-time game? Player 2 LMR L1, 10, 05, 0.
TOPIC 6 REPEATED GAMES The same players play the same game G period after period. Before playing in one period they perfectly observe the actions chosen.
The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
© 2009 Institute of Information Management National Chiao Tung University Lecture Notes II-2 Dynamic Games of Complete Information Extensive Form Representation.
01/16/2002 Reliable Query Reporting Project Participants: Rajgopal Kannan S. S. Iyengar Sudipta Sarangi Y. Rachakonda (Graduate Student) Sensor Networking.
System Analysis & Design Chapter V: Information System Planning 1.Introduction Nowadays, Information Systems plays the main role in success or failure.
1 Game Theory Sequential bargaining and Repeated Games Univ. Prof.dr. M.C.W. Janssen University of Vienna Winter semester Week 46 (November 14-15)
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
Dynamic Competitive Revenue Management with Forward and Spot Markets Srinivas Krishnamoorthy Guillermo Gallego Columbia University Robert Phillips Nomis.
Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia Tech) ITER: A Computational Model to Evaluate Provider and Peer Selection in the Internet Ecosystem.
Political Winds, Financing Constraints and Pharmaceutical Innovation Joshua Linn (UIC) and Robert Kaestner (UIC and NBER) November 9, 2007 Presentation.
Transit price negotiation: repeated game approach Sogea 23 Mai 2007 Nancy, France D.Barth, J.Cohen, L.Echabbi and C.Hamlaoui
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Dynamic Games & The Extensive Form
Monopolistic Competition Large number of firms producing differentiated products By differentiating its product from its competitors’ products, the firm.
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
Pricing in Imperfectly Competitive Markets. Determinants of Pricing Decision Economic analysis of pricing in imperfectly competitive markets identifies.
Bruce Ian Carlin, Miguel Sousa Lobo, S. Viswanathan: Episodic Liquidity Crises: Cooperative and Predatory Trading (The Journal of Finance, 2007) Presented.
Confidence Interval Estimation For statistical inference in decision making:
Chapter 22. The limits to stabilization policy: Credibility and uncertainty ECON320 Prof Mike Kennedy.
How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.
Oligopoly Theory1 Oligopoly Theory (11) Collusion Aim of this lecture (1) To understand the idea of repeated game. (2) To understand the idea of the stability.
Analysis of peering strategy adoption by transit providers in the Internet Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia.
Lecture 6 Reputation Reputations arise in situations where there is an element of repetition, and also where coordination between players is possible.
Confidence Interval Estimation For statistical inference in decision making: Chapter 9.
Noncooperative Collusion The Cournot Oligopoly model was a single-period noncooperative model. In most models of imperfect competition, it is true that.
Monopolistic competition and Oligopoly
1 Industrial Dynamics: Introduction and Basic Concepts Industrial Structures and Dynamics: Evidence, Interpretations and Puzzles by Dosi, G., F. Malerba,
“Group consumption, free-riding, & informal reciprocity agreements”. Why do people use informal reciprocity agreements? Most analysis answers this question.
GAME THEORY and its Application Chapter 06. Outlines... Introduction Prisoner`s dilemma Nash equilibrium Oligopoly price fixing Game Collusion for profit.
Entry Deterrence Players Two firms, entrant and incumbent Order of play Entrant decides to enter or stay out. If entrant enters, incumbent decides to fight.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
BPP LEARNING MEDIA CIMA P2 Advanced Management Accounting 熊家财
1 Strategic Thinking Lecture 7: Repeated Strategic Situations Suggested reading: Dixit and Skeath, ch. 9 University of East Anglia School of Economics.
OVERCOMING COORDINATION FAILURE THROUGH NEIGHBORHOOD CHOICE ~AN EXPERIMENTAL STUDY~ Maastricht University Arno Riedl Ingrid M.T. Rohde Martin Strobel.
Pricing Strategy. Price strategy One of the four major elements of the marketing mix is price. Pricing is an important strategic issue because it is related.
ECON 330 Lecture 20 Tuesday, December 4.
Chapter 8 Pricing Decisions
Chapter 14 & 15 Repeated Games.
Chapter 14 & 15 Repeated Games.
Collusion and f0reclosure (predatory pricing)
Presentation transcript:

“Attractors and Repellors: a Game Theoretic interpretation of the cycles in provider-customer relations” Advanced Workshop on Internet Topology and Economics Atlanta November 2012 Emanuele Giovannetti, Institute for International Management Practice, Anglia Ruskin University, Cambridge UK Joint with Alessio D’Ignazio Bank of Italy Advanced Workshop on Internet Topology and Economics Atlanta November 2012 Emanuele Giovannetti, Institute for International Management Practice, Anglia Ruskin University, Cambridge UK Joint with Alessio D’Ignazio Bank of Italy 1

Motivation Empirical Evidence (Dhamdhere and Dovrolis (2011) shows the presence of cycles of attractiveness and repellence between in Provider to Customer relations. Regular cycles, expressed through the breaking up and reformation of BGP links.(Maybe changes between primary and back links) Dhamdhere and Dovrolis (2011) show that, for many providers, strong attractiveness precedes strong repulsiveness by 3-9 months. We propose a repeated games interconnection model with asymmetric information, that, in equilibrium, reproduces similar cyclical features. We perform a duration analysis, to test through the BGP data, the empirical implications of the model. 2

Outline 1.The Static LADU (Link- Abuse-Dewire-Use) Customer- Provider’s Game : disconnection 2.The repeated LADU game under symmetric information: permanent connection 3.Asymmetric information and the temporary dewiring strategy DBT “Dewire with Probability B for T periods” cycles of connectivity 4.The Incentive Compatibility Constraint for the Customer, the role of 1. the probability of Breaking up, 2.the duration of the dewiring cycles, and 3.the discount rate. 5.Validation: Duration Analysis from the CAIDA’s Data. 3

The The Static LADU (Link- Abuse-Dewire- Use) Customer- Provider’s Game P has two period actions: Link (L) or De-wire (D) with C and C’s actions are to Use (U) or Abuse (A ) the link. P prefers to link (L) if C does not abuse (U), as it receives access revenues for the agreed capacity K ( charges at 95% centile Bill Norton?Nick this does not consider the cost of different destinations) at a (Blended Rate pricing ) MBps price a. C prefers to abuse (A) the link, as this is not observed with certainty, so that the charge is the same aK, but the benefits for the customer is higher. If C abuses the link, P prefers to dewire, as the costs are now greater than the benefits from access revenue, aK. 4

5 The Static LADU (Link- Abuse-Dewire-Use) Customer- Provider Game: inefficiency of the NE

The repeated LADU under symmetric information: over-cooperation. Perfect observability of the customer’s abuse could make cooperation sustainable as an Equilibrium of the infinitely repeated game if the players are sufficiently patient. This can be achieved via trigger strategies where “The provider will start by playing L, and in any future period it will keep playing L unless in the previous history the customer, played A, in this case P will play D forever” 6

Patience, bounded incentives and Cooperation The critical discount rate after which cooperation and stable interconnection are observed in equilibrium is a function of the increase in period profits obtained from abusing the link instead than using it. Under complete information we should be able to observe permanent and stable interconnection decisions but only when the gap in customer’s period profits is not too large. 7

Motivation for asymmetric information Asymmetric information allows C to abuse the link without P been able to observe this. Examples: a random variable observable by P, its profits, revenues, or total traffic, is a function both of an exogenous random shock and of C’s unobserved behaviour, and P is unable to distinguish this. If P is never punishing C, then C will abuse the link. If the Provider decides to punish forever the customer, then there is no scope for cooperation. 8

Need for temporary punishment along the equilibrium path, Literature on price wars and on repeated agency. In each period the provider, P, observes the realization of its total carried traffic without being able to distinguish between its own and the customer’s traffic components due to uncertainty.(Or the final destination of the customer’s traffic) C’s incentives towards deviations require, if P wants to achieve cooperation, to formulate a punishment strategy that will satisfy the customer’s ICC to cooperate. 9

The DBT strategy “Dewire with Probability B for T periods” Consider “The dewire with probability B for T periods (DBT) strategy” for P: “Start by playing the cooperative strategy, L, then switch from L to D, with probability B, If so, play D for T of periods and then revert to L” Given the strategy DBT the critical question is: whether this is sustainable in equilibrium and, if yes, to determine the appropriate length for the punishment phases to ensure that deviations do not occur. The outcome of this strategy produces cycles of wiring and dewiring. 10

Customer’s Value from cooperating The expected discounted payoffs for C from cooperating, (U ), taking into account that cooperation may break down with probability B, at every date is: 11

The deviation Value, V d,induced by the DBT strategy following a customer deviation is such that – she will first obtain once the period payoff from abusing the link, π C (L,A) – this will be followed by T periods of zero punishment payoffs, from being dewired, – and, starting from the T+1 th period, P, will revert to L, she will receive again the value V C. 12 Customer’s Value from deviating

Equilibrium from the customer ICC Proposition 1 The DBT strategy is an equilibrium for the infinitely repeated game of Table (1) if This shows that there is a upper limit for the value of the probability of starting the dewiring phase, B, for the strategy to be an equilibrium. 13

The length of the punishment Phase 14 We can now focus on solving the ICC for the required time length of the punishment phase. Proposition 2 When the strategy DBT is an equilibrium for the infinitely repeated game of Table (1) Cooperation resumes after T+1 periods where:

The period incentive to deviate In the following we focus on the effects of a change in the customer’s period payoffs from deviation, π C (L,A) on the duration, of the punishment period. Proposition 3 If B< (π C (L,U) / π C (L,A),) the length of the punishment phase is increasing in the customer’s period profits obtained from abusing the link: π C (L,A) 15

Probability of breaking up, length of the punishment phase and type-gap The DBT strategy proposed in model has two main elements: 1.The trigger probability of starting a dewiring phase, B. 2. The duration of the punishment phase. Both these features are affected by the customer’s period incentives to deviate, incentives also usually associated to the size gap. 16

Estimate of the Kaplan-Meier curve for the connectivity duration. We first focus on the probability of the survival times of the connection for different classes of Ases type gaps, We consider three possible types of gaps between ASes. These three gaps are defined based on the CAIDA classification of Ases into four different categories. 17

Figure 1 The probability of connection survival, conditional to the existing type-gap among the provider and customer. 18 CAIDA: 1 = Enterprise Customer 2 = Small Transit Provider 3 = Large Transit Provider 4 = Content/Access/Hosting Provider The green curve plotting the Kaplan-Meier for links between ASes having the higher gap in size lies below (for t<30), the two other curves considered, the red one and the blue one. Hence the probability of breaking up an existing link cumulatively increases with the gap size.

Probability of links survival for different durations. Figure 1 shows three curves plotting the time profile of the probability of links survival for different durations. If the Ases’ gap-type is a good proxy for the size of the period incentive to deviate, π C (L,A) given π C (L,U). (If these incentives are larger for the small providers) the strategy punishes more frequently, when this is larger. 19

The probability of the length of punishment and type gap The next Fig 2 shows the probability of the length of punishment (disconnectivity) again as a function of the typegap difference between the ASes. The next graph shows that, the average duration of the punishment period is shorter for type 3 gap. 20

Duration of the punishment phase as a function of the type gap between two providers. 21 The connections with the highest gap require the shortest punishment duration, followed by those with the smallest gap (typegap=1. blue line) and finally the punishment of the =intermediate type (typegap=2) require the longest punishment phases. It emerges a U shaped relation between asymmetry and duration profile of the punishment.

Extensions This last results requires further interpretation given its nonlinear nature. Better metrics should be used as asymmetry in customer cone.. Refine the Econometric analysis Using differences in size of traffic in data available Or differences in customer cones if not… Assessing the amount of asymmetric information, for example measuring local complexity metrics of interconnection Proxies for the discount rate: the probability of AS exiting the market. Thanks.. 22