Representation of finite games as network congestion games (Q378323): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108785983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted congestion games with separable preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network topology and equilibrium existence in weighted network congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank

Revision as of 00:41, 7 July 2024

scientific article
Language Label Description Also known as
English
Representation of finite games as network congestion games
scientific article

    Statements

    Representation of finite games as network congestion games (English)
    0 references
    0 references
    11 November 2013
    0 references
    network games
    0 references
    congestion games
    0 references
    potential games
    0 references
    game isomorphism
    0 references

    Identifiers