An efficient Nash-implementation mechanism for network resource allocation

DOI10.1016/j.automatica.2010.05.013zbMath1200.91125OpenAlexW1988057691MaRDI QIDQ608429

Rahul Jain, Jean Walrand

Publication date: 25 November 2010

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2010.05.013

zbMATH Keywords

game theoryNash equilibriummechanism designbandwidth allocationnetwork auctions

Mathematics Subject Classification ID

Games involving graphs (91A43) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

Auction-based distributed efficient economic operations of microgrid systems, Almost budget balanced mechanisms with scalar bids for allocation of a divisible good, Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives, Auction games for coordination of large-scale elastic loads in deregulated electricity markets, Continuous-time distributed Nash strategy over switching topologies with gain adaptation, An efficient game for vehicle-to-grid coordination problems in smart grids, Auction-based resource allocation game under a hierarchical structure

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiency of Scalar-Parameterized Mechanisms
• Rate control for communication networks: shadow prices, proportional fairness and stability
• The Price of Stability for Network Design with Fair Cost Allocation
• Efficiency Loss in a Network Resource Allocation Game