Skip to main content
Log in

Stochastic optimization on social networks with application to service pricing

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

Abstract

In this paper we develop a combined simulation and optimization approach for solving difficult decision problems on complex dynamic networks. For a specific reference problem we consider a telecommunication service provider who offers a telecommunication service to a market with network effects. More particularly, the service consumption of an individual user depends on both idiosyncratic characteristics and the popularity of this service among the customer’s immediate neighborhood. Both the social network and the individual user preferences are largely heterogeneous and changing over time. In addition the service provider’s decisions are made in absence of perfect knowledge about user preferences. The service provider pursues the strategy of stimulating the demand by offering differentiated prices to the customers. For finding the optimal pricing we apply a stochastic quasi-gradient algorithm that is integrated with a simulation model that drives the evolution of the network and user preferences over time. We show that exploiting the social network structure and implementing differentiated pricing can substantially increase the revenues of a service provider operating on a social network. More generally, we show that stochastic gradient methods represent a powerful methodology for the optimization of decisions in social networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  • Axelrod R, Tesfatsion L (2006) A guide for newcomers to agent-based modeling in the social sciences. In: Tesfatsion L, Judd KL (eds) Handbook of computational economics. North-Holland, Amsterdam, pp 1647–1659

  • Berninghaus SK, Ehrhart K-M, Keser C (2002) Conventions and local interaction structures: experimental evidence. Games Econ Behav 39:177–205

    Article  Google Scholar 

  • Blume LE (1995) The statistical mechanics of best-response strategy revision. Games Econ Behav 11: 111–145

    Google Scholar 

  • Cabral LMB, Salant DJ, Woroch GA (1999) Monopoly pricing with network externalities. Int J Ind Organ 17:199–214

    Article  Google Scholar 

  • Cassandras CG, Lafortune S (2008) Introduction to discrete event systems. Springer, New York

  • Ellison G (1993) Learning, local interaction, and coordination. Econometrica 61(5):1047–1071

    Article  Google Scholar 

  • Eren S, Maglaras C (2010) Monopoly pricing with limited demand information. J Revenue Pricing Manag 9:23–48

    Article  Google Scholar 

  • Ermoliev Y (1976) Methods of stochastic programming. Nauka, Moscow (in Russian)

  • Ermoliev Y (2009) Stochastic quasigradient methods. Encyclopedia of optimization, Kluwer, pp 3801–3807

  • Ermoliev Y, Gaivoronski AA (1992) Stochastic quasigradient methods for optimization of discrete event systems. Ann Oper Res 39:1–39

    Article  Google Scholar 

  • Gaivoronski AA (1978) Nonstationary stochastic optimization problems. Cybern Syst Anal 14(4):575–579

    Article  Google Scholar 

  • Gaivoronski AA (1988) Implementation of stochastic quasigradient methods. In: Ermoliev Yu, Wets RJ-B (eds) Numerical techniques for stochastic optimization. Springer, Berlin, pp 313–352

    Chapter  Google Scholar 

  • Gaivoronski AA (2005) SQG: stochastic programming software environment. In: Wallace SW, Ziemba WT (eds) Applications of stochastic programming. SIAM-MPS, pp 37–60

  • Gaivoronski AA, Shi LY, Sreenivas R (1992) Augmented infinitesimal perturbation analysis: an alternate explanation. J Discret Event Dyn Syst Theory Appl 2:121–138

    Article  Google Scholar 

  • Glasserman P (1991) Gradient estimation via perturbation analysis. Kluwer, Norwell

  • Goldstein AA (1964) Convex programming in Hilbert space. Bull Am Math Soc 70:709–710

    Article  Google Scholar 

  • Gupta S, Jain DC, Sawhney MS (1999) Modeling the evolution of markets with indirect network externalities: an application to digital television. Mark Sci 18(3):396–416

    Article  Google Scholar 

  • Ho YC (1991) Discrete event dynamic systems: analyzing complexity and performance in the modern world. IEEE Press, New York

    Google Scholar 

  • Ho YC, Cao XR (1991) Perturbation analysis of discrete event dynamic systems. Kluwer, Boston

    Book  Google Scholar 

  • Kandori M, Mailath GJ, Rob R (1993) Learning, mutation, and long run equilibria in games. Econometrica 61(1):29–56

    Article  Google Scholar 

  • Katz ML, Shapiro C (1985) Network externalities, competition, and compatibility. Am Econ Rev 75(3): 42–440

    Google Scholar 

  • Keser C, Ehrhart K-M, Berninghaus SK (1998) Coordination and local interaction: experimental evidence. Econ Lett 58:269–275

    Article  Google Scholar 

  • Kiefer J, Wolfowitz J (1952) Stochastic approximation of a maximum of a regression function. Ann Math Stat 23:462–466

    Article  Google Scholar 

  • Kushner H, Clark D (1978) Stochastic approximation methods for constrained and unconstrained systems. Springer, Berlin

    Book  Google Scholar 

  • Levitin ES, Polyak BT (1966) Constrained minimization methods. USSR Comput Math Math Phys 6:1–50

    Article  Google Scholar 

  • Littlechild SC (1975) Two part tariffs and consumption externalities. Bell J Econ Manag Sci 6(2):661–670

    Article  Google Scholar 

  • Marti K (2008) Stochastic optimization methods. Springer, Berlin

    Book  Google Scholar 

  • Nadal J-P, Phan D, Gordon MB, Vannimenus J (2005) Multiple equilibria in a monopoly market with heterogeneous agents and externalities. Quant Finance 5(6):557–568

    Article  Google Scholar 

  • Nemirovski A, Juditsky A, Lan G, Shapiro A (2009) Robust stochastic approximation approach to stochastic programming. SIAM J Optim 19(4):1574–1609

    Article  Google Scholar 

  • Nishino N, Oda SH, Ueda K (2011) Bounded rationality on consumer purchase decisions and product diffusion under network externalities: a study using agent-based simulation and experiments with human subjects. J Adv Comput Intell Intell Inform 15(2):212–219

    Google Scholar 

  • Oren SS, Smith SA (1981) Critical mass and tariff structure in electronic communication markets. Bell J Econ 12(2):467–487

    Article  Google Scholar 

  • Oren SS, Smith SA, Wilson RB (1982) Nonlinear pricing in markets with interdependent demand. Mark Sci 1(3):287–313

    Article  Google Scholar 

  • Pflug C (1988) Stepsize rules, stopping times and their implementation in stochastic quasigradient algorithms. In: Ermoliev Y, Wets J-B (eds) Numerical techniques for stochastic optimization. Springer, New York, 353–372

  • Pflug GC (1996) Optimization of stochastic models—the interface between simulation and optimization. Kluwer, Boston

    Google Scholar 

  • Phan D, Pajot S, Nadal JP (2003) The monopolist’s market with discrete choices and network externality revisited: small-worlds, phase transition and avalanches in an ACE framework. In: 9th annual meeting of the society of computational economics, Seattle, 11–13 July 2003

  • Phan D, Gordon MB, Nadal J-P (2003) Social interactions in economic theory: an insight from statistical mechanics. In: Bourgine P, Nadal J-P (eds) Cognitive economics. Springer, New York, pp 335–357

  • Robbins H, Monro S (1951) A stochastic approximation method. Ann Math Stat 22:400–407

    Article  Google Scholar 

  • Robinson S (1996) Analysis of sample-path optimization. Math Oper Res 21(3):513–528

    Article  Google Scholar 

  • Rolphs J (1974) A theory of interdependent demand for a communication service. Bell J Econ Manag Sci 5(1):16–37

    Article  Google Scholar 

  • Rosen JB (1960) The gradient projection method for nonlinear programming, part 1: linear constraints. SIAM J Appl Math 8:181–217

    Article  Google Scholar 

  • Rubinstein RY, Shapiro A (1983) Discrete event systems: sensitivity analysis and stochastic optimization. John Wiley, New York

    Google Scholar 

  • Schwartz A, Polak E (1997) Family of projected descent methods for optimization problems with simple bounds. J Optim Theory Appl 92:1–31

    Article  Google Scholar 

  • Sundararajan A (2004) Nonlinear pricing and type-dependent network effects. Econ Lett 83:107–113

    Article  Google Scholar 

  • Tesfatsion L (2001) Introduction to the special issue on agent-based computational economics. J Econ Dyn Control 25(34):281–293

    Article  Google Scholar 

  • Tesfatsion L (2002) Agent-based computational economics: growing economics from the bottom up. Artif Life 8:55–82

    Article  Google Scholar 

  • Vriend NJ (1995) Self-organization of markets: an example of a computational approach. Comput Econ 8(3):205–231

    Article  Google Scholar 

  • Young HP (1993) The evolution of conventions. Econometrica 61(1):57–84

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Denis M. Becker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Becker, D.M., Gaivoronski, A.A. Stochastic optimization on social networks with application to service pricing. Comput Manag Sci 11, 531–562 (2014). https://doi.org/10.1007/s10287-013-0201-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-013-0201-7

Keywords

Navigation