Generalized Nash bargaining solution for bandwidth allocation

DOI10.1016/J.COMNET.2005.12.006MaRDI QIDQ2432666zbMATH OpenOpenAlexFDO

Authors Corinne Touati, Eitan Altman, Jérôme Galtier

Publication date 25 October 2006

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.2433

zbMATH Keywords

bandwidth allocationfairnessNash bargaining

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Cooperative games (91A12)

Recommendations

• Nash equilibrium based fairness
• A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
• To be fair or efficient or a bit of both
• Decentralized bandwidth control subject to two-layer constraints
• Nash bargaining solution allocation is not suitable for datacenter jobs

Cited in

(8)

• Nash equilibrium based fairness
• A new two-party bargaining mechanism
• A game-theoretic analysis of bandwidth allocation under a user-grouping constraint
• Decentralized bandwidth control subject to two-layer constraints
• Nash bargaining solution allocation is not suitable for datacenter jobs
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
• Analytical modeling of bargaining solutions for multicast cellular services
• Cooperative power-aware scheduling in grid computing environments

This page was built for publication: Generalized Nash bargaining solution for bandwidth allocation

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