Design of price mechanisms for network resource allocation via price of anarchy

DOI10.1007/S10107-010-0379-1MaRDI QIDQ662298zbMATH OpenOpenAlexFDO

Authors Ying-Ju Chen, Jiawei Zhang

Publication date 22 February 2012

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s10107-010-0379-1

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Communication networks in operations research (90B18)

Recommendations

• The price of anarchy and the design of scalable resource allocation mechanisms
• The price of anarchy of the proportional allocation mechanism revisited
• Efficiency Loss in a Network Resource Allocation Game
• The price of anarchy of serial, average and incremental cost sharing
• Price competition with elastic traffic

Cites work

• scientific article; zbMATH DE number 1226097 (Why is no real title available?)
• Algorithmic Game Theory
• Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
• Average cost pricing versus serial cost sharing: An axiomatic comparison
• Axiomatizations of game theoretical solutions for one-output cost sharing problems
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Capacity choice and allocation: strategic behavior and supply chain performance
• Demand Compatible Equitable Cost Sharing Prices
• Efficiency Loss in a Network Resource Allocation Game
• How bad is selfish routing?
• Implementation of first-best allocations via generalized tax schedules
• Multi-product serial cost sharing: An incompatibility with the additivity axiom
• Nash Equilibrium and Welfare Optimality
• No-Envy and Consistency in Economies with Indivisible Goods
• On the uniqueness of equilibrium in Cournot oligopoly and other games
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Serial Cost Sharing
• Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information
• The Determination of Marginal Cost Prices under a Set of Axioms
• The price of anarchy of finite congestion games
• The price of anarchy of serial, average and incremental cost sharing
• The price of routing unsplittable flow
• Three methods to share joint costs or surplus
• Worst-case equilibria

Cited in

(9)

• The price of anarchy and the design of scalable resource allocation mechanisms
• Structural Information and Communication Complexity
• On the price of anarchy for high-price links
• Optimal cost sharing for capacitated facility location games
• Almost budget-balanced VCG mechanisms to assign multiple objects
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• Utility Design for Distributed Resource Allocation—Part I: Characterizing and Optimizing the Exact Price of Anarchy
• scientific article; zbMATH DE number 5926392 (Why is no real title available?)
• The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context

This page was built for publication: Design of price mechanisms for network resource allocation via price of anarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662298)