Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1876382026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Price of Anarchy for Polynomial Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Traffic Equilibrium Paradoxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Games with Atomic Players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inefficiency of Equilibria in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment problem for a general network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Strategies for Atomic Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Congestion Games Among Coalitions / 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: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions / 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: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy is independent of the network topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934708 / rank
 
Normal rank

Latest revision as of 01:17, 29 June 2024

scientific article
Language Label Description Also known as
English
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
scientific article

    Statements

    Stackelberg Strategies and Collusion in Network Games with Splittable Flow (English)
    0 references
    0 references
    12 February 2009
    0 references

    Identifiers