Achievability of efficient satisfaction equilibria in self-configuring networks

DOI10.1007/978-3-642-35582-0_1MaRDI QIDQ2840911zbMATH OpenOpenAlexFDO

Authors François Mériaux, Samir Perlaza, Samson Lasaulce, H. Vincent Poor, Zhu Han

Publication date 24 July 2013

Published in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35582-0_1

zbMATH Keywords

efficient satisfaction equilibriumgames in satisfaction formpower controlsupermodular games

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18) Games involving graphs (91A43)

Recommendations

• Computational Science – ICCS 2005
• Self-interested routing in queueing networks
• scientific article; zbMATH DE number 6381644
• Distributed selfish load balancing on networks
• Management of Variable Data Streams in Networks

Cites work

• S-modular games, with queueing applications
• A Social Equilibrium Existence Theorem*
• Game theory
• Game Theory in Wireless and Communication Networks
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• S-modular games and power control in wireless networks

Cited in

(1)

• Near-optimal network design with selfish agents

This page was built for publication: Achievability of efficient satisfaction equilibria in self-configuring networks

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