Strategic decentralization in binary choice composite congestion games (Q322512): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4630496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniqueness of Equilibrium in Atomic Splittable Routing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Collusion in Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Beat-Your-Rival” Routing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Routing in Arbitrary Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed equilibrium (ME) for multiclass routing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Oligopolistic Competition in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric approach to the price of anarchy in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Equilibrium Behaviors on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies and collusion in network games with splittable flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of collusion in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion in atomic splittable routing games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies for selfish routing in general multicommodity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniqueness property for networks with several origin-destination pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Conditions for Uniqueness of Equilibrium in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Price of Anarchy” Under Nonlinear and Asymmetric Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion network problems and related games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users / 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: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegation equilibrium payoffs in integer-splitting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalitions in Nonatomic Network Congestion Games / rank
 
Normal rank

Latest revision as of 17:06, 12 July 2024

scientific article
Language Label Description Also known as
English
Strategic decentralization in binary choice composite congestion games
scientific article

    Statements

    Strategic decentralization in binary choice composite congestion games (English)
    0 references
    0 references
    7 October 2016
    0 references
    routing
    0 references
    decentralization
    0 references
    Stackelberg game
    0 references
    composite congestion game
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references