Equilibrium computation in atomic splittable singleton congestion games

DOI10.1007/978-3-319-59250-3_36zbMath1422.91148OpenAlexW2559836051MaRDI QIDQ2401182

Tobias Harks, Veerle Timmermans

Publication date: 31 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59250-3_36

zbMATH Keywords

polynomial time algorithmNash equilibrium computationatomic splittable congestion gamessingleton strategies

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43)

Related Items (3)

Correction to: ``Equilibrium computation in resource allocation games ⋮ Unnamed Item ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games

This page was built for publication: Equilibrium computation in atomic splittable singleton congestion games