中文
相关论文

相关论文: Selfish Creation of Social Networks

200 篇论文

Network creation games are well-established for investigating the decentralized formation of communication networks, like the Internet or social networks. In these games, selfish agents that correspond to network nodes strategically create…

计算机科学与博弈论 · 计算机科学 2025-02-11 Merlin de la Haye , Pascal Lenzner , Daniel Schmand , Nicole Schröder

We propose a new class of game-theoretic models for network formation in which strategies are not directly related to edge choices, but instead correspond more generally to the exertion of social effort. The observed social network is thus…

计算机科学与博弈论 · 计算机科学 2010-09-23 Christian Borgs , Jennifer Chayes , Jian Ding , Brendan Lucier

Selfish Network Creation focuses on modeling real world networks from a game-theoretic point of view. One of the classic models by Fabrikant et al. [PODC'03] is the network creation game, where agents correspond to nodes in a network which…

计算机科学与博弈论 · 计算机科学 2018-01-08 Davide Bilò , Pascal Lenzner

Network creation games investigate complex networks from a game-theoretic point of view. Based on the original model by Fabrikant et al. [PODC'03] many variants have been introduced. However, almost all versions have the drawback that edges…

计算机科学与博弈论 · 计算机科学 2017-07-03 Ankit Chauhan , Pascal Lenzner , Anna Melnichenko , Louise Molitor

During a pandemic people have to find a trade-off between meeting others and staying safely at home. While meeting others is pleasant, it also increases the risk of infection. We consider this dilemma by introducing a game-theoretic network…

计算机科学与博弈论 · 计算机科学 2022-04-26 Tobias Friedrich , Hans Gawendowicz , Pascal Lenzner , Anna Melnichenko

Network Creation Games are a well-known approach for explaining and analyzing the structure, quality and dynamics of real-world networks like the Internet and other infrastructure networks which evolved via the interaction of selfish agents…

计算机科学与博弈论 · 计算机科学 2020-06-29 Davide Bilò , Tobias Friedrich , Pascal Lenzner , Anna Melnichenko

Robustness is one of the key properties of nowadays networks. However, robustness cannot be simply enforced by design or regulation since many important networks, most prominently the Internet, are not created and controlled by a central…

计算机科学与博弈论 · 计算机科学 2016-07-08 Ankit Chauhan , Pascal Lenzner , Anna Melnichenko , Martin Münn

Network Creation Games are an important framework for understanding the formation of real-world networks. These games usually assume a set of indistinguishable agents strategically buying edges at a uniform price leading to a network among…

计算机科学与博弈论 · 计算机科学 2022-05-02 Martin Bullinger , Pascal Lenzner , Anna Melnichenko

We investigate several variants of a network creation model: a group of agents builds up a network between them while trying to keep the costs of this network small. The cost function consists of two addends, namely (i) a constant amount…

网络与互联网体系结构 · 计算机科学 2007-05-23 Johannes J. Schneider , Scott Kirkpatrick

Many real-world networks, like the Internet, are not the result of central design but instead the outcome of the interaction of local agents who are selfishly optimizing for their individual utility. The famous Network Creation Game…

计算机科学与博弈论 · 计算机科学 2023-05-12 Tobias Friedrich , Hans Gawendowicz , Pascal Lenzner , Arthur Zahn

Network creation games model the creation and usage costs of networks formed by a set of selfish peers. Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links. In doing so, a peer can…

计算机科学与博弈论 · 计算机科学 2015-03-20 Andreas Cord-Landwehr , Martina Hüllmann , Peter Kling , Alexander Setzer

Network Creation Games(NCGs) model the creation of decentralized communication networks like the Internet. In such games strategic agents corresponding to network nodes selfishly decide with whom to connect to optimize some objective…

计算机科学与博弈论 · 计算机科学 2020-06-29 Hagen Echzell , Tobias Friedrich , Pascal Lenzner , Anna Melnichenko

We study the strategic formation of multi-layer networks, where each layer represents a different type of relationship between the nodes in the network and is designed to maximize some utility that depends on the topology of that layer and…

计算机科学与博弈论 · 计算机科学 2015-10-29 Ebrahim Moradi Shahrivar , Shreyas Sundaram

Studying the impact of cooperation in strategic settings is one of the cornerstones of algorithmic game theory. Intuitively, allowing more cooperation yields equilibria that are more beneficial for the society of agents. However, for many…

计算机科学与博弈论 · 计算机科学 2025-10-02 Hans Gawendowicz , Pascal Lenzner , Lukas Weyand

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 in turn are the theoretical counterpart of…

计算机科学与博弈论 · 计算机科学 2016-07-25 Davide Bilò , Luciano Gualà , Stefano Leucci , Guido Proietti

We live in a world full of networks where our economy, our communication, and even our social life crucially depends on them. These networks typically emerge from the interaction of many entities, which is why researchers study agent-based…

计算机科学与博弈论 · 计算机科学 2024-11-07 Davide Bilò , Sarel Cohen , Tobias Friedrich , Hans Gawendowicz , Nicolas Klodt , Pascal Lenzner , George Skretas

How do rational agents self-organize when trying to connect to a common target? We study this question with a simple tree formation game which is related to the well-known fair single-source connection game by Anshelevich et al. (FOCS'04)…

计算机科学与博弈论 · 计算机科学 2020-09-24 Davide Bilò , Tobias Friedrich , Pascal Lenzner , Anna Melnichenko , Louise Molitor

We consider the dynamic behavior of several variants of the Network Creation Game, introduced by Fabrikant et al. [PODC'03]. Equilibrium networks in these models have desirable properties like low social cost and small diameter, which makes…

计算机科学与博弈论 · 计算机科学 2013-05-29 Bernd Kawald , Pascal Lenzner

We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et…

计算机科学与博弈论 · 计算机科学 2015-06-09 Andreas Cord-Landwehr , Pascal Lenzner

Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such games can be evaluated through the costs of the system…

分布式、并行与集群计算 · 计算机科学 2015-05-18 Petr Kuznetsov , Stefan Schmid
‹ 上一页 1 2 3 10 下一页 ›