Related papers: A Network Game of Dynamic Traffic
We study atomic routing games where every agent travels both along its decided edges and through time. The agents arriving on an edge are first lined up in a \emph{first-in-first-out} queue and may wait: an edge is associated with a…
The recent emergence of navigational tools has changed traffic patterns and has now enabled new types of congestion-aware routing control like dynamic road pricing. Using the fundamental diagram of traffic flows - applied in macroscopic and…
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. In particular, we assume agents optimize a linear combination…
We consider the problem of optimal charging of plug-in electric vehicles (PEVs). We treat this problem as a multi-agent game, where vehicles/agents are heterogeneous since they are subject to possibly different constraints. Under the…
In this paper, we study a routing and travel-mode choice problem for mobility systems with a multimodal transportation network as a ``mobility game" with coupled action sets. We develop a game-theoretic framework to study the impact on…
We study the performance of approximate Nash equilibria for linear congestion games. We consider how much the price of anarchy worsens and how much the price of stability improves as a function of the approximation factor $\epsilon$. We…
A central question in algorithmic game theory is to measure the inefficiency (ratio of costs) of Nash equilibria (NE) with respect to socially optimal solutions. The two established metrics used for this purpose are price of anarchy (POA)…
We consider a class of targeted intervention problems in dynamic network and graphon games. First, we study a general dynamic network game in which players interact over a graph and maximize their heterogeneous, concave goal functionals,…
We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges.…
In this paper, we consider a heterogeneous traffic network with multiple users classes which differ considerably in their path selection objective. In particular, we consider two classes of users: ones who seek to minimize social cost…
We introduce an atomic congestion game with two types of agents, cars and trucks, to model the traffic flow on a road over various time intervals of the day. Cars maximize their utility by finding a trade-off between the time they choose to…
The price of anarchy has become a standard measure of the efficiency of equilibria in games. Most of the literature in this area has focused on establishing worst-case bounds for specific classes of games, such as routing games or more…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
Evolutionary anti-coordination games on networks capture real-world strategic situations such as traffic routing and market competition. In such games, agents maximize their utility by choosing actions that differ from their neighbors'…
We consider an autonomous navigation problem, whereby a traveler aims at traversing an environment in which an adversary tries to set an ambush. A two players zero sum game is introduced. Players' strategies are computed as random path…
In this study, we analyse the convergence and stability of dynamic system optimal (DSO) traffic assignment with fixed departure times. We first formulate the DSO traffic assignment problem as a strategic game wherein atomic users select…
We study a security game over a network played between a $defender$ and $k$ $attackers$. Every attacker chooses, probabilistically, a node of the network to damage. The defender chooses, probabilistically as well, a connected induced…
The objective of this paper is to initiate a qualitative analysis of dynamic flow in traffic networks by using the competitive equilibrium model of multiple market systems. A network is modeled as a dynamic graph where routes (edges) are…
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…
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium…