Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Price of Anarchy
Resource Allocation
Related Publications
(8)
Efficiency Loss in a Network Resource Allocation Game
Nearoptimal network design with selfish agents
A scalable network resource allocation mechanism with bounded efficiency loss
Existence and Nash implementation of effcient sharing rules for a commonly owned technology
Optimal allocation of a divisible good to strategic buyers
Subscribe
Academic
Publications
Design of price mechanisms for network resource allocation via price of anarchy
Design of price mechanisms for network resource allocation via price of anarchy,Y. J. Chen,J. Zhang
Edit
Design of price mechanisms for network resource allocation via price of anarchy
(
Citations: 11
)
BibTex

RIS

RefWorks
Download
Y. J. Chen
,
J. Zhang
Published in 2005.
Cumulative
Annual
Citation Context
(6)
...The efficiency loss of the Kelly mechanism was first studied by Johari and Tsitsiklis (2004); subsequently, several others have studied efficiency loss of related resource allocation mechanisms, including
Chen and Zhang (2008)
, Johari et al. (2005), Johari and Tsitsiklis (2006), Maheswaran (2003), Maheswaran and Basar (2004), Moulin (2008b), Sanghavi and Hajek (2004), and Yang and Hajek (2006a)...
Ramesh Johari
,
et al.
Efficiency of ScalarParameterized Mechanisms
...There exists a large volume of literature in terms of studying PoA in the contexts of wireline networking, e.g., [9], [
19
], [20]...
Lok Man Law
,
et al.
Price of Anarchy for Cognitive MAC Games
...Chen and Zhang [
5
] recently presented a class of pricing mechanisms satisfying certain axioms for which they proved improved bounds on the price of anarchy, if users are price anticipating...
...Chen and Zhang [
5
] defined certain axioms for a feasible pricing mechanism and derived for quadratic cost functions (which corresponds to linear marginal cost functions) a slightly better efficiency guarantee (0:686) than the bound (2=3) proved for the marginal cost pricing, see Johari and Tsitsiklis [14]...
...Tsitsiklis [14], Moulin [20], and Chen and Zhang [
5
], shows that for bounding the price of anarchy it is sufficient to bound the price of anarchy for linear utility functions and single link networks...
...Lemma 3.3: [[
5
],[14],[20]] For bounding the price of anarchy, it is enough to consider instances in which utility functions are linear...
Tobias Harks
,
et al.
Efficiency and stability of Nash equilibria in resource allocation gam...
...The first mechanisms to be evaluated in this way were the familiar outputsharing methods ([10],[11],[29],[37]) and costsharing methods ([
4
],[12])...
...Classic examples of cost sharing methods include the regulation of congestion by fees: peakload pricing [32], telephone billing [2], access to a network [22], capacitysharing in networks [
4
],[14] [26]...
...An important difference between our computation of the price of anarchy and that proposed in the recent literature ([
4
],[10],[11],[12],[29],[37]) inspiring this paper, is the accounting of the overcharge...
...1Marginal cost pricing is another familiar method: each unit of demand is charged the marginal cost at total demand ([27] and [
4
],[12] discuss respectively its axiomatic and incentives properties...
...Here we compute the three guaranteed surplus for every n, in the simple and much studied case ([
4
],[10]) of a quadratic cost function...
Hervé Moulin
.
The price of anarchy of serial, average and incremental cost sharing
...Equations (4) and (
5
) imply that for any odd q, b (q) = b (q +1) and Uq = Uq+1...
...We find that equation (
5
) where c replaces a defines a qfair mechanism achieving the cap e (q) = b (q) ((4))...
Hervé Moulin
.
On efficient and almost budget balanced allocation mechanisms
References
(28)
The price of routing unsplittable ow
(
Citations: 70
)
B. Awerbuch
,
Y. Azar
,
A. Epstein
Conference:
ACM Symposium on Theory of Computing  STOC
, 2005
Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
(
Citations: 85
)
L. J. Billera
,
D. C. Heath
Journal:
Mathematics of Operations Research  MOR
, vol. 7, no. 1, pp. 3239, 1982
The Theory of Public Utility Pricing
(
Citations: 145
)
Stephen J. Brown
,
David Sumner Sibley
Published in 1986.
Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance
(
Citations: 150
)
Gérard P. Cachon
,
Martin A. Lariviere
Journal:
Management Science  MANAGE SCI
, vol. 45, no. 8, pp. 10911108, 1999
The price of anarchy of finite congestion games
(
Citations: 153
)
George Christodoulou
,
Elias Koutsoupias
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 6773, 2005
Sort by:
Citations
(11)
Efficiency of ScalarParameterized Mechanisms
(
Citations: 20
)
Ramesh Johari
,
John N. Tsitsiklis
Journal:
Operations Research
, vol. 57, no. 4, pp. 823839, 2009
Almost budgetbalanced VCG mechanisms to assign multiple objects
(
Citations: 18
)
Hervé Moulin
Journal:
Journal of Economic Theory  J ECON THEOR
, vol. 144, no. 1, pp. 96119, 2009
Price of Anarchy for Cognitive MAC Games
(
Citations: 7
)
Lok Man Law
,
Jianwei Huang
,
Mingyan Liu
,
ShuoYen Robert Li
Conference:
Global Telecommunications Conference, . GLOBECOM . IEEE  GLOBECOM
, pp. 16, 2009
Efficiency and stability of Nash equilibria in resource allocation games
(
Citations: 3
)
Tobias Harks
,
Konstantin Miller
Conference:
International Conference on Game Theory for Networks, GameNets  GAMENETS
, 2009
InterSession Network Coding with Strategic Users: A GameTheoretic Analysis of Network Coding
Amir Hamed Mohsenian Rad
,
Jianwei Huang
,
Vincent W. S. Wong
,
Sidharth Jaggi
,
Robert Schober
Journal:
Computing Research Repository  CORR
, vol. abs/0904.2, 2009