Design of price mechanisms for network resource allocation via price of anarchy (Q662298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance / 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: Three methods to share joint costs or surplus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency Loss in a Network Resource Allocation Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate control for communication networks: shadow prices, proportional fairness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-product serial cost sharing: An incompatibility with the additivity axiom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibrium and Welfare Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demand Compatible Equitable Cost Sharing Prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of serial, average and incremental cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial Cost Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average cost pricing versus serial cost sharing: An axiomatic comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of first-best allocations via generalized tax schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the inefficiency of equilibria in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Determination of Marginal Cost Prices under a Set of Axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizations of game theoretical solutions for one-output cost sharing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-Envy and Consistency in Economies with Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness of equilibrium in Cournot oligopoly and other games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220399 / rank
 
Normal rank

Latest revision as of 23:03, 4 July 2024

scientific article
Language Label Description Also known as
English
Design of price mechanisms for network resource allocation via price of anarchy
scientific article

    Statements

    Design of price mechanisms for network resource allocation via price of anarchy (English)
    0 references
    0 references
    0 references
    22 February 2012
    0 references
    0 references
    0 references
    0 references

    Identifiers