Atomic Congestion Games: Fast, Myopic and Concurrent

Fotakis, D; Kaporis, A; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Kaporis, A	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T01:56:37Z
dc.date.available	2014-03-01T01:56:37Z
dc.date.issued	2008	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/28188
dc.subject	Atomic Congestion Games	en
dc.subject	Randomized Experiment	en
dc.subject	Nash Equilibria	en
dc.title	Atomic Congestion Games: Fast, Myopic and Concurrent	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-79309-0_12	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-79309-0_12	en
heal.publicationDate	2008	en
heal.abstract	We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a re- source each (out of m resources) so that her selfish delay there is not much. The problem of "maintaining" global progress while allowing concurrent play is ex- actly what is examined and answered here. We	en
heal.journalName	Theory of Computing Systems / Mathematical Systems Theory	en
dc.identifier.doi	10.1007/978-3-540-79309-0_12	en