Competing for customers in a social network - Université Paris 1 Panthéon-Sorbonne Accéder directement au contenu
Article Dans Une Revue Journal of Dynamics and Games Année : 2014

Competing for customers in a social network

Résumé

Customers' proclivities to buy products often depend heavily on who else is buying the same product. This gives rise to non-cooperative games in which firms sell to customers located in a ``social network''. Nash Equilibrium (NE) in pure strategies exist in general. In the quasi-linear case, NE are unique. If there are no a priori biases between customers and firms, there is a cut-off level above which high cost firms are blockaded at an NE, while the rest compete uniformly throughout the network. Otherwise firms could end up as regional monopolies. The connectivity of a customer is related to the money firms spend on him. This becomes particularly transparent when externalities are dominant: NE can be characterized in terms of the invariant measures on the recurrent classes of the Markov chain underlying the social network. When cost functions of firms are convex, instead of just linear, NE need no longer be unique as we show via an example. But uniqueness is restored if there is enough competition between firms or if their valuations of clients are anonymous. Finally we develop a general model of nonlinear externalities and show that existence of NE remains intact.

Dates et versions

hal-01432210 , version 1 (11-01-2017)

Identifiants

Citer

Bernard de Meyer, Pradeep K. Dubey, Rahul Garg. Competing for customers in a social network . Journal of Dynamics and Games, 2014, 1 (3), pp.377 - 409. ⟨10.3934/jdg.2014.1.377⟩. ⟨hal-01432210⟩
134 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More