作者: Davide Bilò , Luciano Gualà , Stefano Leucci , Guido Proietti
关键词:
摘要: Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation processes, which turn are the theoretical counterpart of several economics, social, computational applications on Internet. However, generally adopted assumption is that players a common complete information about ongoing network, quite unrealistic practice. In this paper, we consider more compelling scenario only limited network they embedded in. More precisely, explore game theoretic implications assuming view restricted k-neighborhood, one most qualified ,local-knowledge models used distributed computing. To respect, define suitable equilibrium concept provide comprehensive set upper lower bounds price anarchy for entire range values k.