toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Records Links
Author Harrison, R.; Hernandez, G.; Munoz, R. doi  openurl
  Title A discrete model of market interaction in the presence of social networks and price discrimination Type Journal Article
  Year 2019 Publication Mathematical Social Sciences Abbreviated Journal Math. Soc. Sci.  
  Volume 102 Issue Pages 48-58  
  Keywords Social networks; Agent-based models; Price discrimination  
  Abstract In this paper, we provide a model to study the equilibrium outcome in a market characterized by the competition between two firms offering horizontally differentiated services, in a context where consumers are the basic unit of decision on the demand side and are related through a social network. In the model, we consider that consumers make optimal choice, participation and consumption decisions, while firms optimally decide their tariffs, eventually using nonlinear pricing schemes. This approach permits us to identify and model two different kinds of network externalities, one associated with tariff-mediated network externalities and the other related to participation network externalities. We apply the model to the telecommunication industry, where we study the impact of alternative regulatory interventions. We provide numerical evidence suggesting that policies designed to reduce horizontal differentiation might be more effective than those designed to limit access charges; this result seems robust to the presence of different forms of price discrimination. We should interpret these findings cautiously due to the existence of potential implementation costs for each policy. (C) 2019 Elsevier B.V. All rights reserved.  
  Address [Harrison, Rodrigo] Univ Adolfo Ibanez, Fac Ingn & Ciencias, Santiago, Chile, Email: rodrigo.harrison@uai.cl;  
  Corporate Author Thesis  
  Publisher Elsevier Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 0165-4896 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000500049400006 Approved no  
  Call Number UAI @ eduardo.moreno @ Serial 1077  
Permanent link to this record
 

 
Author Moreno, S.; Pfeiffer, J.J.; Neville, J. pdf  doi
openurl 
  Title Scalable and exact sampling method for probabilistic generative graph models Type Journal Article
  Year 2018 Publication Data Mining And Knowledge Discovery Abbreviated Journal Data Min. Knowl. Discov.  
  Volume 32 Issue 6 Pages 1561-1596  
  Keywords Network analysis; Network models; Social networks; Graph generation; Scalable sampling  
  Abstract Interest in modeling complex networks has fueled the development of multiple probabilistic generative graph models (PGGMs). PGGMs are statistical methods that model the network distribution and match common characteristics of real world networks. Recently, scalable sampling algorithms for well known PGGMs, made the analysis of large-scale, sparse networks feasible for the first time. However, it has been demonstrated that these scalable sampling algorithms do not sample from the original underlying distribution, and sometimes produce very unlikely graphs. To address this, we extend the algorithm proposed in Moreno et al.(in: IEEE 14th international conference on data mining, pp 440-449, 2014) for a single model and develop a general solution for a broad class of PGGMs. Our approach exploits the fact that PGGMs are typically parameterized by a small set of unique probability valuesthis enables fast generation via independent sampling of groups of edges with the same probability value. By sampling within groups, we remove bias due to conditional sampling and probability reallocation. We show that our grouped sampling methods are both provably correct and efficient. Our new algorithm reduces time complexity by avoiding the expensive rejection sampling step previously necessary, and we demonstrate its generality, by outlining implementations for six different PGGMs. We conduct theoretical analysis and empirical evaluation to demonstrate the strengths of our algorithms. We conclude by sampling a network with over a billion edges in 95s on a single processor.  
  Address [Moreno, Sebastian] Univ Adolfo Ibanez, Fac Sci & Engn, Santiago, Chile, Email: sebastian.moreno.araya@gmail.com;  
  Corporate Author Thesis  
  Publisher Springer Place of Publication Editor  
  Language English Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title  
  Series Volume Series Issue Edition  
  ISSN 1384-5810 ISBN Medium  
  Area Expedition Conference  
  Notes WOS:000444383000002 Approved no  
  Call Number UAI @ eduardo.moreno @ Serial 913  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: