Multi-Player Diffusion Games on Graph Classes

Laurent Bulteau, Vincent Froese, Nimrod Talmon

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

ملخص

We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players, we investigate the existence of pure Nash equilibriafor at least three players on different classes of graphs including paths, cycles, grid graphs and hypercubes; as a main contribution, we answer an open question proving that there is no Nash equilibriumfor three players on m × n grids with min {m, n} ≥ 5. Further, extending results of Etesami and Basar [3] for two players, we prove the existence of pure Nash equilibriafor four players on every d-dimensional hypercube.

اللغة الأصليةإنجليزيّة أمريكيّة
الصفحات (من إلى)363-380
عدد الصفحات18
دوريةInternet Mathematics
مستوى الصوت12
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 نوفمبر 2016

All Science Journal Classification (ASJC) codes

  • !!Modeling and Simulation
  • !!Computational Mathematics
  • !!Applied Mathematics

بصمة

أدرس بدقة موضوعات البحث “Multi-Player Diffusion Games on Graph Classes'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا