In this paper, we examine the class of congestion games with player-specific payoff functions introduced by Milchtaich, I. (1996). Focusing on the special case of two resources, we give a short and simple method for identifying all Nash equilibria in pure strategies. We also provide a...

Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively)...

This paper studies a non-cooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...

We propose a model of discrete time dynamic congestion games with atomic players and a single source-destination pair. The latencies of edges are composed by free-flow transit times and possible queuing time due to capacity constraints. We give a precise description of the dynamics induced by...

This paper studies a model for cooperative congestion games. There is an array of cooperative games V and a player’s strategy is to choose a subset of the set V. The player gets a certain payoff from each chosen game. The paper demonstrates that if a payoff is the Shapley or the Banzhaf value,...

The RIde-hail VEhilce Routing (RIVER) problem describes how drivers in a ride-hail market form a dynamic routing strategy according to the expected reward in each zone of the market. We model this decision-making problem as a Markov decision process (MDP) and view the drivers as playing an MDP...

This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource. Additionally, there exists an information asymmetry where each...