1 citations · 1 across the 5 of their papers we have counts for
10 papers
Network Creation with Homophilic Agents
Martin Bullinger, Pascal Lenzner, Anna Melnichenko
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…
Social Distancing Network Creation
Tobias Friedrich, Hans Gawendowicz, Pascal Lenzner +1
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 c…
Efficiency and Stability in Euclidean Network Design
Wilhelm Friedemann, Tobias Friedrich, Hans Gawendowicz +5
Network Design problems typically ask for a minimum cost sub-network from a given host network. This classical point-of-view assumes a central authority enforcing the optimum solut…
Selfish Creation of Social Networks
Davide Bilò, Tobias Friedrich, Pascal Lenzner +2
Understanding real-world networks has been a core research endeavor throughout the last two decades. Network Creation Games are a promising approach for this from a game-theoretic…
Fair Tree Connection Games with Topology-Dependent Edge Cost
Davide Bilò, Tobias Friedrich, Pascal Lenzner +2
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 sin…
Flow-Based Network Creation Games
Hagen Echzell, Tobias Friedrich, Pascal Lenzner +1
Network Creation Games(NCGs) model the creation of decentralized communication networks like the Internet. In such games strategic agents corresponding to network nodes selfishly d…
Geometric Network Creation Games
Davide Bilò, Tobias Friedrich, Pascal Lenzner +1
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…
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming
Timo Kötzing, J. A. Gregor Lagodzinski, Johannes Lengler +1
For theoretical analyses there are two specifics distinguishing GP from many other areas of evolutionary computation. First, the variable size representations, in particular yieldi…
Selfish Network Creation with Non-Uniform Edge Cost
Ankit Chauhan, Pascal Lenzner, Anna Melnichenko +1
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 introduce…
On Selfish Creation of Robust Networks
Ankit Chauhan, Pascal Lenzner, Anna Melnichenko +1
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…