Congestion Games with Capacitated Resources
dc.contributor.author | Gourvès, Laurent | |
dc.contributor.author | Monnot, Jérôme
HAL ID: 178759 ORCID: 0000-0002-7452-6553 | |
dc.contributor.author | Moretti, Stefano
HAL ID: 739814 ORCID: 0000-0003-3627-3257 | |
dc.contributor.author | Kim Thang, Nguyen | |
dc.date.accessioned | 2013-09-06T08:41:22Z | |
dc.date.available | 2013-09-06T08:41:22Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/11630 | |
dc.language.iso | en | en |
dc.subject | Polynomial algorithms | en |
dc.subject | pure Nash equilibrium | en |
dc.subject | congestion games | en |
dc.subject.ddc | 003 | en |
dc.title | Congestion Games with Capacitated Resources | en |
dc.type | Communication / Conférence | |
dc.description.abstracten | We extend congestion games to the setting where every resource is endowed with a capacity which possibly limits its number of users. From the negative side, we show that a pure Nash equilibrium is not guaranteed to exist in any case and we prove that deciding whether a game possesses a pure Nash equilibrium is NP-complete. Our positive results state that congestion games with capacities are potential games in the well studied singleton case. Polynomial algorithms that compute these equilibria are also provided. | en |
dc.identifier.citationpages | 204-215 | en |
dc.relation.ispartofseriestitle | Lecture Notes in Computer Science | en |
dc.relation.ispartofseriesnumber | 7615 | en |
dc.relation.ispartoftitle | Algorithmic Game Theory 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings | en |
dc.relation.ispartofeditor | Serna, Maria | |
dc.relation.ispartofpublname | Springer | en |
dc.relation.ispartofpublcity | Berlin | en |
dc.relation.ispartofdate | 2012 | |
dc.relation.ispartofpages | 263 | en |
dc.relation.ispartofurl | http://dx.doi.org/10.1007/978-3-642-33996-7 | en |
dc.identifier.urlsite | http://hal.archives-ouvertes.fr/hal-00752265 | |
dc.subject.ddclabel | Recherche opérationnelle | en |
dc.relation.ispartofisbn | 978-3-642-33995-0 | en |
dc.relation.conftitle | 5th International Symposium on Algorithmic Game Theory, SAGT 2012 | en |
dc.relation.confdate | 2012-10 | |
dc.relation.confcity | Barcelone | en |
dc.relation.confcountry | Espagne | en |
dc.relation.forthcoming | non | en |
dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-33996-7_18 | en |