English
Related papers

Related papers: On the Tree Conjecture for the Network Creation Ga…

200 papers

Most products are produced and sold by supply chain networks, where an interconnected network of producers and intermediaries set prices to maximize their profits. I show that there exists a unique equilibrium in a price-setting game on a…

Computer Science and Game Theory · Computer Science 2019-04-16 Toomas Hinnosaar

We introduce a network design game where the objective of the players is to design the interconnections between the nodes of two different networks $G_1$ and $G_2$ in order to maximize certain local utility functions. In this setting, each…

Computer Science and Game Theory · Computer Science 2016-12-22 Ebrahim Moradi Shahrivar , Shreyas Sundaram

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…

Computer Science and Game Theory · Computer Science 2015-06-09 Andreas Cord-Landwehr , Pascal Lenzner

We study selfish routing games where users can choose between regular and priority service for each network edge on their chosen path. Priority users pay an additional fee, but in turn they may travel the edge prior to non-priority users,…

Computer Science and Game Theory · Computer Science 2026-02-09 Yang Li , Alexander Skopalik , Marc Uetz

Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an…

Theoretical Economics · Economics 2022-07-26 Pierpaolo Battigalli , Fabrizio Panebianco , Paolo Pin

We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest…

Computer Science and Game Theory · Computer Science 2013-06-10 S. Nikoletseas , P. Panagopoulou , C. Raptopoulos , P. G. Spirakis

In Social Networks, it is often interesting to study type of networks formed, its efficiency with respect to social objective and which networks are stable. Many work have already been there in this area. Players in network formation game…

Computer Science and Game Theory · Computer Science 2016-04-14 Dinesh Govindaraj

We introduce and analyze greedy equilibria (GE) for the well-known model of selfish network creation by Fabrikant et al.[PODC'03]. GE are interesting for two reasons: (1) they model outcomes found by agents which prefer smooth adaptations…

Computer Science and Game Theory · Computer Science 2012-10-31 Pascal Lenzner

In this paper we study a generalization of the classic \emph{network creation game} in the scenario in which the $n$ players sit on a given arbitrary \emph{host graph}, which constrains the set of edges a player can activate at a cost of…

Computer Science and Game Theory · Computer Science 2014-07-03 Davide Bilò , Luciano Gualà , Stefano Leucci , Guido Proietti

We consider clustering games in which the players are embedded in a network and want to coordinate (or anti-coordinate) their strategy with their neighbors. The goal of a player is to choose a strategy that maximizes her utility given the…

Computer Science and Game Theory · Computer Science 2020-11-20 Pieter Kleer , Guido Schäfer

We study a network formation game where agents receive benefits by forming connections to other agents but also incur both direct and indirect costs from the formed connections. Specifically, once the agents have purchased their…

Computer Science and Game Theory · Computer Science 2019-06-04 Yu Chen , Shahin Jabbari , Michael Kearns , Sanjeev Khanna , Jamie Morgenstern

We study stable matching problems in networks where players are embedded in a social context, and may incorporate friendship relations or altruism into their decisions. Each player is a node in a social network and strives to form a good…

Computer Science and Game Theory · Computer Science 2012-04-27 Elliot Anshelevich , Onkar Bhardwaj , Martin Hoefer

We consider a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In our model, each link has unit price and each agent tries to minimize its cost, which is either its local diameter…

Computer Science and Game Theory · Computer Science 2015-04-21 Shayan Ehsani , Saber Shokat Fadaee , MohammadAmin Fazli , Abbas Mehrabian , Sina Sadeghian Sadeghabad , MohammadAli Safari , Morteza Saghafian

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…

Computer Science and Game Theory · Computer Science 2015-10-29 Ebrahim Moradi Shahrivar , Shreyas Sundaram

We study a class of games in which a finite number of agents each controls a quantity of flow to be routed through a network, and are able to split their own flow between multiple paths through the network. Recent work on this model has…

Computer Science and Game Theory · Computer Science 2007-11-09 P. W. Goldberg , P. Polpinit

We study non-atomic congestion games on parallel-link networks with affine cost functions. We investigate the power of machine-learned predictions in the design of coordination mechanisms aimed at minimizing the impact of selfishness. Our…

Computer Science and Game Theory · Computer Science 2025-07-11 George Christodoulou , Vasilis Christoforidis , Alkmini Sgouritsa , Ioannis Vlachos

Organizations consist of individuals connected by their responsibilities, incentives, and reporting structure. These connections are aptly represented by a network, hierarchical or other, which is often used to divide tasks. A primary goal…

Computer Science and Game Theory · Computer Science 2017-03-09 Swaprava Nath , Balakrishnan , Narayanaswamy

This is the first paper to address the topology structure of Job Edge-Fog interconnection network in the perspective of network creation game. A two level network creation game model is given, in which the first level is similar to the…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-17 Rupei Xu , András Faragó , Jason P. Jue

We consider network contribution games, where each agent in a social network has a budget of effort that he can contribute to different collaborative projects or relationships. Depending on the contribution of the involved agents a…

Computer Science and Game Theory · Computer Science 2012-04-27 Elliot Anshelevich , Martin Hoefer

We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex combination of 1-\alpha_i times his direct…

Computer Science and Game Theory · Computer Science 2013-02-21 Po-An Chen , Bart de Keijzer , David Kempe , Guido Schaefer