1 citations · 1 across the 3 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2018★ 1 cited
Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs
Tobias Harks, Veerle Timmermans
In this paper, we compute -approximate Nash equilibria in atomic splittable polymatroid congestion games with convex Lipschitz continuous cost functions. The main approach relie…
cs.GT2016
Equilibrium Computation in Resource Allocation Games
Veerle Tan-Timmermans, Tobias Harks
We study the equilibrium computation problem for two classical resource allocation games: atomic splittable congestion games and multimarket Cournot oligopolies. For atomic splitta…
cs.GT2015
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
Tobias Harks, Veerle Timmermans
We study uniqueness of Nash equilibria in atomic splittable congestion games and derive a uniqueness result based on polymatroid theory: when the strategy space of every player is…