Pure Nash equilibria in player-specific and weighted congestion games (Q1014625): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish unsplittable flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / 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: Social optimality and cooperation in nonatomic congestion games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with truly asynchronous threshold logic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum congestion spanning trees / rank
 
Normal rank

Latest revision as of 13:07, 1 July 2024

scientific article
Language Label Description Also known as
English
Pure Nash equilibria in player-specific and weighted congestion games
scientific article

    Statements

    Pure Nash equilibria in player-specific and weighted congestion games (English)
    0 references
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    congestion games
    0 references
    Nash equilibria
    0 references
    matroids
    0 references
    0 references