37 citations · 215 across the 24 of their papers we have counts for
21 papers · 1 filter
Monotonicity of Equilibria in Nonatomic Congestion Games
Roberto Cominetti, Valerio Dose, Marco Scarsini
This paper studies the monotonicity of equilibrium costs and equilibrium loads in nonatomic congestion games, in response to variations of the demands. The main goal is to identify…
Phase Transitions of the Price-of-Anarchy Function in Multi-Commodity Routing Games
Roberto Cominetti, Valerio Dose, Marco Scarsini
We consider the behavior of the price of anarchy and equilibrium flows in nonatomic multi-commodity routing games as a function of the traffic demand. We analyze their smoothness w…
Strategic Behavior and No-Regret Learning in Queueing Systems
Lucas Baudin, Marco Scarsini, Xavier Venel
This paper studies a dynamic discrete-time queuing model where at every period players get a new job and must send all their jobs to a queue that has a limited capacity. Players ha…
Best-Response dynamics in two-person random games with correlated payoffs
Hlafo Alfie Mimun, Matteo Quattropani, Marco Scarsini
We consider finite two-player normal form games with random payoffs. Player A's payoffs are i.i.d. from a uniform distribution. Given p in [0, 1], for any action profile, player B'…
Online Learning in Supply-Chain Games
Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami +2
We study a repeated game between a supplier and a retailer who want to maximize their respective profits without full knowledge of the problem parameters. After characterizing the…
Correlated Equilibria in Large Anonymous Bayesian Games
Frederic Koessler, Marco Scarsini, Tristan Tomala
We consider multi-population Bayesian games with a large number of players. Each player aims at minimizing a cost function that depends on this player's own action, the distributio…
Approximation and Convergence of Large Atomic Congestion Games
Roberto Cominetti, Marco Scarsini, Marc Schröder +1
We consider the question of whether, and in what sense, Wardrop equilibria provide a good approximation for Nash equilibria in atomic unsplittable congestion games with a large num…
The Price of Anarchy in Routing Games as a Function of the Demand
Roberto Cominetti, Valerio Dose, Marco Scarsini
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 s…
Pure Nash Equilibria and Best-Response Dynamics in Random Games
Ben Amiet, Andrea Collevecchio, Marco Scarsini +1
In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are dra…
Search for an Immobile Hider on a Stochastic Network
Tristan Garrec, Marco Scarsini
Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harry's goal is to be found as late as po…
Ordinary and Prophet Planning under Uncertainty in Bernoulli Congestion Games
Roberto Cominetti, Marco Scarsini, Marc Schröder +1
We consider an atomic congestion game in which each player participates in the game with an exogenous and known probability , independently of everybody else, or…
Decomposition of games: some strategic considerations
Joseph Abdou, Nikolaos Pnevmatikos, Marco Scarsini +1
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of deco…
The Buck-Passing Game
Roberto Cominetti, Matteo Quattropani, Marco Scarsini
We consider a game in which players are the vertices of a directed graph. Initially, Nature chooses one player according to some fixed distribution and gives her a buck, which repr…
Demand-Independent Optimal Tolls
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Network tolls are a prominen…
When is selfish routing bad? The price of anarchy in light and heavy traffic
Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos +1
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nonatomic congestion games with multiple origin-destination (O/D) pairs. Empirical s…
Dynamic Atomic Congestion Games with Seasonal Flows
Marco Scarsini, Marc Schröder, Tristan Tomala
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 time…
On the Price of Anarchy of Highly Congested Nonatomic Network Games
Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some…
Location Games on Networks: Existence and Efficiency of Equilibria
Gaëtan Fournier, Marco Scarsini
We consider a game where a finite number of retailers choose a location, given that their potential consumers are distributed on a network. Retailers do not compete on price but on…
A Colonel Blotto Gladiator Game
Yosef Rinott, Marco Scarsini, Yaming Yu
We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-o…
On the Core of Dynamic Cooperative Games
Ehud Lehrer, Marco Scarsini
We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow th…
Existence of equilibria in countable games: an algebraic approach
Valerio Capraro, Marco Scarsini
Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Sever…