Atomic congestion games among coalitions

Fotakis, D; Kontogiannis, S; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Kontogiannis, S	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/28187
dc.subject	Algorithmic Game Theory	en
dc.subject	Atomic Congestion Games	en
dc.subject	Congestion Game	en
dc.subject	Potential Function	en
dc.subject	Price of Anarchy	en
dc.subject	User Participation	en
dc.subject	Nash Equilibria	en
dc.subject	Nash Equilibrium	en
dc.title	Atomic congestion games among coalitions	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/1383369.1383383	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1383369.1383383	en
heal.publicationDate	2008	en
heal.abstract	We consider algorithmic questions concerning the existence, tractability, and quality of Nash equilibria, in atomic congestion games among users participating in selfish coalitions. We introduce a coalitional congestion model among atomic players and demonstrate many interesting similarities with the noncooperative case. For example, there exists a potential function proving the existence of pure Nash equilibria (PNE) in the unrelated parallel	en
heal.journalName	ACM Transactions on Algorithms	en
dc.identifier.doi	10.1145/1383369.1383383	en