activity
20182026
most citedAn improved bound for the price of anarchy for related machine scheduling

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.GTShow all

7 papers · 1 filter

cs.GT2026

Interval Scheduling Games with Color-Based Concurrent Jobs

Vipin Ravindran Vijayalakshmi, Marc Schroder, Tami Tamir

We consider a game-theoretic variant of an interval scheduling problem. Every job is associated with a length, a weight, and a color. Each player controls all the jobs of a specifi…

cs.GT2025

Nash Flows Over Time with Tolls

Shaul Rosner, Marc Schröder, Laura Vargas Koch

We study a dynamic routing game motivated by traffic flows. The base model for an edge is the Vickrey bottleneck model. That is, edges are equipped with a free flow transit time an…

cs.GT2024

Popularity in location games

Gaëtan Fournier, Marc Schröder

We study a variant of the Hotelling-Downs model of spatial competition between firms where consumer choices are influenced by their individual preferences as well as the popularity…

cs.GT20241 cited

An improved bound for the price of anarchy for related machine scheduling

Andre Berger, Arman Rouhani, Marc Schröder

In this paper, we introduce an improved upper bound for the efficiency of Nash equilibria in utilitarian scheduling games on related machines. The machines have varying speeds and…

cs.GT2019

Network Investment Game with Wardrop Followers

Daniel Schmand, Marc Schröder, Alexander Skopalik

We study a two-sided network investment game consisting of two sets of players, called providers and users. The game is set in two stages. In the first stage, providers aim to maxi…

cs.GT2019

Negative Prices in Network Pricing Games

Andrés Cristi, Marc Schröder

In a Stackelberg network pricing game, a leader sets prices for a given subset of edges so as to maximize profit, after which one or multiple followers choose a shortest path from…