English
Related papers

Related papers: Financial Network Games

200 papers

Peer-To-Peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and…

Computer Science and Game Theory · Computer Science 2007-05-23 Chiranjeeb Buragohain , Divyakant Agrawal , Subhash Suri

In this paper, we consider the problem of network design on network games. We study the conditions on the adjacency matrix of the underlying network to design a game such that the Nash equilibrium coincides with the social optimum. We…

Computer Science and Game Theory · Computer Science 2022-09-13 Abhishek Shende , Deepanshu Vasal , Sriram Vishwanath

Autonomous and learning agents increasingly participate in markets - setting prices, placing bids, ordering inventory. Such agents are not just aiming to optimize in an uncertain environment; they are making decisions in a game-theoretical…

Computer Science and Game Theory · Computer Science 2025-06-24 Martin Bichler , Julius Durmann , Matthias Oberlechner

We study games in which a network mediates strategic spillovers and externalities among the players. How does a planner optimally target interventions that change individuals' private returns to investment? We analyze this question by…

Computer Science and Game Theory · Computer Science 2020-01-28 Andrea Galeotti , Benjamin Golub , Sanjeev Goyal

We study a network congestion game of discrete-time dynamic traffic of atomic agents with a single origin-destination pair. Any agent freely makes a dynamic decision at each vertex (e.g., road crossing) and traffic is regulated with given…

Computer Science and Game Theory · Computer Science 2017-05-05 Zhigang Cao , Bo Chen , Xujin Chen , Changjun Wang

This paper addresses a class of network games played by dynamic agents using their outputs. Unlike most existing related works, the Nash equilibrium in this work is defined by functions of agent outputs instead of full agent states, which…

Optimization and Control · Mathematics 2023-04-27 Meichen Guo , Claudio De Persis

Players are arranged on a regular lattice and coded with a specific strategy for a pre-defined game. Each player sums their payoffs from playing the game with each of their neighbors, and then adopts the strategy of the most successful…

Dynamical Systems · Mathematics 2015-08-03 Stewart D. Johnson

An important scenario for smart grids which encompass distributed electrical networks is given by the simultaneous presence of aggregators and individual consumers. In this work, an aggregator is seen as an entity (a coalition) which is…

Computer Science and Game Theory · Computer Science 2015-09-25 Olivier Beaude , Cheng Wan , Samson Lasaulce

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the…

General Economics · Economics 2022-12-01 Leonardo Massai , Giacomo Como , Fabio Fagnani

In this article we discuss network growth based on Prisoner's Dilemma(PD) where palyers on nodes in a network palay with its linked players. The players estimate total profits in the PD. When a new node is attached, the node make linkes to…

Physics and Society · Physics 2009-09-29 Norihito Toyota

Networks have always played a special role for human beings in shaping social relations, forming public opinion, and driving economic equilibria. Nowadays, online networked platforms dominate digital markets and capitalization…

Physics and Society · Physics 2024-04-17 Antonio Scala , Marco Delmastro

As the most critical production factor in the era of the digital economy, data will have a significant impact on social production and development. Energy enterprises possess data that is interconnected with multiple industries,…

Computer Science and Game Theory · Computer Science 2024-03-18 Zongxian Wang , Jie Song

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

The widening inequality in income distribution in recent years, and the associated excessive pay packages of CEOs in the U.S. and elsewhere, is of growing concern among policy makers as well as the common person. However, there seems to be…

Economics · Quantitative Finance 2014-11-13 Venkat Venkatasubramanian , Yu Luo , Jay Sethuraman

Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or nodes each of whom has a budget for purchasing links; each…

Computer Science and Game Theory · Computer Science 2008-06-11 Nikolaos Laoutaris , Laura J. Poplawski , Rajmohan Rajaraman , Ravi Sundaram , Shang-Hua Teng

The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with edge costs and edge capacities, each agent wants to construct a path from a source to a sink with low cost. The users…

Computer Science and Game Theory · Computer Science 2023-03-01 Tesshu Hanaka , Toshiyuki Hirose , Hirotaka Ono

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

In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed market-based resource allocation system. Multiple users decide how to distribute their budget (bids) among multiple machines…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Michal Feldman , Kevin Lai , Li Zhang

Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with…

Computational Complexity · Computer Science 2025-10-03 Tamás Fleiner , Zsuzsanna Jankó , Ildikó Schlotter , Alexander Teytelboym

In this paper we consider non-atomic games in populations that are provided with a choice of preventive policies to act against a contagion spreading amongst interacting populations, be it biological organisms or connected computing…

Computer Science and Game Theory · Computer Science 2025-03-04 Yi Zhang , Sanjiv Kapoor
‹ Prev 1 8 9 10 Next ›