Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (Q3162508): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3137530339 / 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: Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Strong Equilibrium in Job Scheduling Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Outcome Functions Guaranteeing Existence and Pareto Optimality of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Pareto Front of Multi-criteria Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-solutions in vector minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibrium and Welfare Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy is independent of the network topology / rank
 
Normal rank

Latest revision as of 09:15, 3 July 2024

scientific article
Language Label Description Also known as
English
Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
scientific article

    Statements

    Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games (English)
    0 references
    0 references
    0 references
    19 October 2010
    0 references
    0 references
    0 references