Related papers: Financial Network Games
Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…
The preference graph is a combinatorial representation of the structure of a normal-form game. Its nodes are the strategy profiles, with an arc between profiles if they differ in the strategy of a single player, where the orientation…
Cournot competition is a fundamental economic model that represents firms competing in a single market of a homogeneous good. Each firm tries to maximize its utility---a function of the production cost as well as market price of the…
A quantum financial approach to finite games of strategy is addressed, with an extension of Nash's theorem to the quantum financial setting, allowing for an entanglement of games of strategy with two-period financial allocation problems…
This paper provides a general framework for modeling financial contagion in a system with obligations in multiple illiquid assets (e.g., currencies). In so doing, we develop a multi-layered financial network that extends the single network…
We consider the problem of predicting human players' actions in repeated strategic interactions. Our goal is to predict the dynamic step-by-step behavior of individual players in previously unseen games. We study the ability of neural…
We consider a simplified version of the Wealth Game, which is an agent-based financial market model with many interesting features resembling the real stock market. Market makers are not present in the game so that the majority traders are…
We consider signed networks in which connections or edges can be either positive (friendship, trust, alliance) or negative (dislike, distrust, conflict). Early literature in graph theory theorized that such networks should display…
We study scenarios where multiple sellers of a homogeneous good compete on prices, where each seller can only sell to some subset of the buyers. Crucially, sellers cannot price-discriminate between buyers. We model the structure of the…
To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…
In many markets, like electricity or cloud computing markets, providers incur large costs for keeping sufficient capacity in reserve to accommodate demand fluctuations of a mostly fixed user base. These costs are significantly affected by…
Interaction strategies for reward in competitive environments are significantly influenced by the nature and extent of available information. In financial markets, particularly foreign exchange (forex), traders operate independently with…
The recent rise of renewable energy produced by many decentralized sources yields interesting market design challenges for electrical grids. Balancing supply and demand in such networks is both a temporal and spatial challenge due to…
We study decentralized markets with the presence of middlemen, modeled by a non-cooperative bargaining game in trading networks. Our goal is to investigate how the network structure of the market and the role of middlemen influence the…
This study investigates the prevention of market manipulation using a price-impact model of financial market trading as a linear system. First, I define a trading game between speculators such that they implement a manipulation trading…
In order to scale transaction rates for deployment across the global web, many cryptocurrencies have deployed so-called "Layer-2" networks of private payment channels. An idealized payment network behaves like a Credit Network, a model for…
We study Cournot competition among firms in a networked marketplace that is centrally managed by a market maker. In particular, we study a situation in which a market maker facilitates trade between geographically separate markets via a…
Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow where all flow exists simultaneously, and users care about…
In this paper we introduce and study {\em all-pay bidding games}, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn,…
We present a stylized model of the allocation of resources on a network. By considering as a concrete example the network of sectors of the airspace, where each node is a sector characterized by a maximal number of simultaneously present…