Asynchronous Congestion Games (Q3655138): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 08:51, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	Asynchronous Congestion Games	scientific article

Statements

scholarly article

0 references

Asynchronous Congestion Games (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-02029-2_5

0 references

0 references

Maria Polukarov

0 references

Moshe Tennenholtz

0 references

Graph Theory, Computational Intelligence and Thought

0 references

publication date

7 January 2010

0 references

full work available at URL

https://eprints.soton.ac.uk/267876/1/ACG_30Jan2008_AAMAS_short.pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Asynchronous Congestion Games

0 references

The price of anarchy of finite congestion games

0 references

The complexity of pure Nash equilibria

0 references

Congestion games with player-specific payoff functions

0 references

0 references

Potential games

0 references

A class of games possessing pure-strategy Nash equilibria

0 references

Distributed games

0 references

0 references

Algorithmic mechanism design

0 references

Truthful algorithms for scheduling selfish tasks on parallel machines

0 references

0 references

Congestion games with load-dependent failures: Identical resources

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3655138

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3655138&oldid=35145757"