1 citations · 1 across the 3 of their papers we have counts for
5 papers
Matroid Bases with Cardinality Constraints on the Intersection
Stefan Lendl, Britta Peis, Veerle Timmermans
Given two matroids and on a common ground set with base sets and $\mathcal{B…
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…
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…
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…
Barnette's Conjecture
Lean Arts, Meike Hopman, Veerle Timmermans
This report provides an overview of theorems and statements related to a conjecture stated by D.W. Barnette in 1969 (which is an open problem in graph theory): Every cubic, biparti…