dc.contributor.author | Mavronicolas, Marios | en |
dc.contributor.author | Milchtaich, I. | en |
dc.contributor.author | Monien, Burkhard | en |
dc.contributor.author | Tiemann, K. | en |
dc.creator | Mavronicolas, Marios | en |
dc.creator | Milchtaich, I. | en |
dc.creator | Monien, Burkhard | en |
dc.creator | Tiemann, K. | en |
dc.date.accessioned | 2019-11-13T10:41:13Z | |
dc.date.available | 2019-11-13T10:41:13Z | |
dc.date.issued | 2007 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54504 | |
dc.description.abstract | We consider a special case of weighted congestion games with player-specific latency functions where each player uses for each particular resource a fixed (non-decreasing) delay function together with a player-specific constant. For each particular resource, the resource-specific delay function and the playerspecific constant (for that resource) are composed by means of a group operation (such as addition or multiplication) into a player-specific latency function. We assume that the underlying group is a totally ordered abelian group. In this way, we obtain the class of weighted congestion games with player-specific constants | en |
dc.description.abstract | we observe that this class is contained in the new intuitive class of dominance weighted congestion games. We obtain the following results: Games on parallel links: Every unweighted congestion game has a generalized ordinal potential. There is a weighted congestion game with 3 players on 3 parallel links that does not have the Finite Best-Improvement Property. There is a particular best-improvement cycle for general weighted congestion games with player-specific latency functions and 3 players whose outlaw implies the existence of a pure Nash equilibrium. This cycle is indeed outlawed for dominance weighted congestion games with 3 players - and hence for weighted congestion games with player-specific constants and 3 players. Network congestion games: For unweighted symmetric network congestion games with player-specific additive constants, it is PLS-complete to find a pure Nash equilibrium. Arbitrary (non-network) congestion games: Every weighted congestion game with linear delay functions and player-specific additive constants has a weighted potential. © Springer-Verlag Berlin Heidelberg 2007. | en |
dc.source | 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-38049018063&partnerID=40&md5=dee95c04bc66fb7f34d079b361357923 | |
dc.subject | Nash equilibrium | en |
dc.subject | Game theory | en |
dc.subject | Artificial intelligence | en |
dc.subject | Functions | en |
dc.subject | Latency functions | en |
dc.title | Congestion games with player-specific constants | en |
dc.type | info:eu-repo/semantics/article | |
dc.description.volume | 4708 LNCS | en |
dc.description.startingpage | 633 | |
dc.description.endingpage | 644 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :33</p> | en |
dc.source.abbreviation | Lect. Notes Comput. Sci. | en |