International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

International Journal of Computer Networks and Applications (IJCNA)

International Journal of Computer Networks and Applications (IJCNA)

Published By EverScience Publications

ISSN : 2395-0455

Rethinking Audience Clustering in Sports Market using Gossip Protocol

Author NameAuthor Details

Asif Ali Banka, Roohie Naaz

Asif Ali Banka[1]

Roohie Naaz [2]

[1]Department of Computer Science and Engineering, National Institute of Technology, Srinagar, India

[2]Department of Computer Science and Engineering, National Institute of Technology, Srinagar, India


Analytics and inferences have found their place in all the business domains varying from large-scale businesses with criticality to small scale business with less criticality. Sports are considered to be big business in its aspects like amount of money spent on it but in its other version like number of people associated with it, it is comparatively a small industry. Sports analytics have changed their dimension both in the manner they are thought about and number of participation from scientific society that grew over the years. Contribution from analytics is being looked from by sports management to enhance various industries associated to it. The authors realize that sports industry is a close, strongly connected group that is very similar in its behavior to a social network. The authors propose a graph theoretic model in context of sports analytics that presents preliminary study of using gossip protocol for sharing information among members of sports oriented social network.

Index Terms


Gossip Protocol


Social Network


  1. 1.
    Fry, Michael J., and Jeffrey W. Ohlmann. "Introduction to the special issue on analytics in sports, part I: General sports applications." (2012): 105-108.
  2. 2.
    Davenport, Thomas H. "Analytics in sports: The new science of winning." International Institute for Analytics 2 (2014): 1-28.
  3. 3.
  4. 4.
    James, Bill. The new Bill James historical baseball abstract. Simon and Schuster, 2010.
  5. 5.
    Lewis, Michael. Moneyball: The art of winning an unfair game. WW Norton & Company, 2004.
  6. 6.
    Lindsey, George R. "An investigation of strategies in baseball." Operations Research 11.4 (1963): 477-501.
  7. 7.
  8. 8.
    Lucey P, Morgan S, Wiens J, Yue Y (2016) KDD workshop on large-scale sports analytics. http://www. large- scale- sports-
MathSport International (2017).
  9. 9.
    Davis J, van Haaren J, Kaytoue M, Zimmermann A (2013) Machine learning and data mining for sports analytics.
  10. 10.
    Deason L (2006) ShotLink a statistical superstar. Accessed January 3, 2012,
  11. 11.
    Miller, Thomas W. Sports analytics and data science: winning the game with methods and models. FT Press, 2015.
  12. 12.
    Andrew Ball, “Should Teams Use Baseball America’s Rankings to Draft?” Beyond the Box Score website, Dec. 24, 2013, teams-use-baseball-americas-rankings-to-draft
  13. 13.
    Winston, Wayne L. Mathletics: How gamblers, managers, and sports enthusiasts use mathematics in baseball, basketball, and football. Princeton University Press, 2012.
  14. 14.
    Ira Boudway, “Baseball Set for Data Deluge as Player Monitoring Goes Hi-Tech,” Bloomberg News, March 31, 2011.
  15. 15.
    Eddie Metz, “Saviormetrics,” ESPN the Magazine, April 14, 2013, writing-moneyball-next-chapter-reinventing-analytics-espn-magazine.
  16. 16.
    Stan Conte information from Molly Knight, “The Hurt Talker,” ESPN The Magazine, August 13, 2012, and Stan Conte panel presentation, “Staying on the Field: Injury Analytics,” MIT Sports Analytics Conference 2013
  17. 17.
    Catapult Sports case study: Tom Myslinski, Jacksonville Jaguars, Catapult Systems website,
  18. 18.
    Ameet Sachdev, “Baseball teams get dynamic with ticket pricing,” Chicago Tribune, May 12, 2013, 20130512_1_stubhub-bleacher-ticket-ticket-reselling
  19. 19.
    Adam Rubin, “Mets introduce Sandy Alderson,”, October 30, 2010,
  20. 20.
    Information about Allardyce comes from regular in-person meetings during 2012-13 and 2013-14 season, an interview for this study by Al Sim (Feb 2014), and the following articles: Sam Allardyce – Barclays Premier League Profile allardyce?cc=5739
  21. 21.
    “Scoring higher revenue with analytics,” SAS customer stories,
  22. 22.
    Information about the New England Patriots from an interview with Jessica Gelman and from Heather Fletcher, “Pats’ Pact: Fans Are Family,” Target Marketing, December 2011, emails-retain-season-ticket-holders/
  23. 23.
    Kate Kaye, “How P&G Inspired Cleveland Indians to Offer Fewer Bobbleheads,” Ad Age, March 18, 2013, cleveland-indians/240362/
  24. 24.
    Anton Troianovski, “Phone Firms Sell Data on Customers,” The Wall Street Journal, May 22, 2013, p. B1.
  25. 25.
    “NBA Launches New Tracking System to Capture Player Statistics,” CBS News, January 27, 2014, statistics/

  26. 26.
    Rein, Irving, Ben Shields, and Adam Grossman. The Sports Strategist: Developing Leaders for a High-Performance Industry. Oxford University Press, USA, 2014.
  27. 27.
    Fort, Rodney, and James Quirk. "Optimal competitive balance in a season ticket league." Economic inquiry 49.2 (2011): 464-473.
  28. 28.
    Kesenne, Stefan. "Revenue sharing and owner profits in professional team sports." Journal of sports Economics 8.5 (2007): 519-529.
  29. 29.
    Rysman, Marc. "The economics of two-sided markets." Journal of Economic Perspectives 23.3 (2009): 125-43.
  30. 30.
    Wright, M. B. "50 years of OR in sport." Journal of the Operational Research Society 60.1 (2009): S161-S168.
  31. 31.
    Kahn, Lawrence M. "The sports business as a labor market laboratory." Journal of Economic Perspectives 14.3 (2000): 75-94.
  32. 32.
    Mullin, Bernard J., Stephen Hardy, and William Sutton. Sport Marketing 4th Edition. Human Kinetics, 2014.
  33. 33.
  34. 34.
  35. 35.
    Fan, Weiguo, and Michael D. Gordon. "The power of social media analytics." Communications of the ACM 57.6 (2014): 74-81.
  36. 36.
    Stieglitz, Stefan, et al. "Social media analytics." Business & Information Systems Engineering 6.2 (2014): 89-96.
  37. 37.
    Shah, Devavrat. "Network gossip algorithms." Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on. IEEE, 2009.
  38. 38.
    S. Bornholdt and H. Georg Schuster, editors Handbook of graphs and networks, Wiley-VCH, 2003.
  39. 39.
    Haeupler, Bernhard, et al. "Discovery through gossip." Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. ACM, 2012.
  40. 40.
  41. 41.
    O. Babaoglu and M. Jelasity, Self-* properties through gossiping, Philos Trans R Soc A 366 (2008), 3747–3757. 

  42. 42.
    S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized gossip algorithms, IEEE Trans. on Infor. Theory 52 (2006), 2508–2530.
  43. 43.
    J.-Y. Chen and G. Pandurangan, Almost-optimal gossip-based aggregate computation, SIAM J Comput 41 (2012), 455–483. 

  44. 44.
    A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, Epidemic algorithms for replicated database maintenance, In PODC, 1987, pp. 1–12.
  45. 45.
    R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, In 
FOCS, 2000, pp. 565–574.
  46. 46.
    M. Jelasity, A. Montresor, and O. Babaoglu, T-man: Gossip-based fast overlay topology 
construction, Comput Netw 53 (2009), 2321–2339.
  47. 47.
 D. Kempe, A. Dobra, and J. Gehrke, Gossip-based computation of aggregate information, In 
FOCS, 2003, pp. 482–491. 

  48. 48.
    D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, In 
STOC, 2001, pp. 163–172. 

  49. 49.
    D. Mosk-Aoyama and D. Shah, Computing separable functions via gossip, In PODC, 2006, pp. 113–122.
  50. 50.
    Shah, Devavrat. "Gossip algorithms." Foundations and Trends® in Networking 3.1 (2009): 1-125.
  51. 51.
    J. Augustine, G. Pandurangan, and P. Robinson, Fast byzantine agreement in dynamic networks, In PODC, 2013, pp. 74–83.
  52. 52.
    J. Augustine, A. Rahman Molla, E. Morsy, G. Pandurangan, P. Robinson, and E. Upfal, Storage and search in dynamic peer-to-peer networks, In SPAA, 2013, pp. 53–62. 

  53. 53.
    J. Augustine, G. Pandurangan, P. Robinson, and E. Upfal, Towards robust and efficient computation in dynamic peer-to-peer networks., In SODA, 2012, pp. 551–569.
  54. 54.
    C. Avin, M. Koucký, and Z. Lotker, How to explore a fast-changing world (cover time of a simple random walk on evolving graphs), In ICALP (1), 2008, pp. 121–132. 

  55. 55.
    A. E. F. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi, A. Panconesi, F. Pasquale, and R. Silvestri, Rumor spreading in random evolving graphs, In ESA, 2013, pp. 325–336.
  56. 56.
    A. E. F. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri, Flooding time in edge- markovian dynamic graphs, In PODC, 2008, pp. 213–222. 

  57. 57.
    A. E. F. Clementi, R. Silvestri, and L. Trevisan, Information spreading in dynamic graphs, In PODC, 2012, pp. 37–46. 

  58. 58.
    J.-Y. Chen and G. Pandurangan, Almost-optimal gossip-based aggregate computation, SIAM J Comput 41 (2012), 455–483
  59. 59.
    F. Chierichetti, S. Lattanzi, and A. Panconesi, Almost tight bounds on rumor spreading and conductance, In STOC, 2010, pp. 399–408. 

  60. 60.
    B. Doerr, T. Friedrich, and T. Sauerwald, Quasi-random rumor spreading, In SODA, 2008, 
pp. 773–781.
  61. 61.
    G. Giakkoupis, Tight bounds for rumor spreading in graphs of a given conductance, In STACS, 
2011, pp. 57–68. 

  62. 62.
    A. D. Sarma, A. R. Molla, and G. Pandurangan, Fast distributed computation in dynamic networks via random walks, In DISC, 2012, pp. 136–150.
  63. 63.
    R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, In 
FOCS, 2000, pp. 565–574.
  64. 64.
    Brefeld, Ulf, and Albrecht Zimmermann. "Guest editorial: Special issue on sports analytics." Data Mining and Knowledge Discovery 31.6 (2017): 1577-1579.