An Efficient Game Form for Unicast Service Provisioning

DOI10.1109/TAC.2011.2163353MaRDI QIDQ5352708zbMATH OpenFDO

Authors A. Kakhbod, Demosthenis Teneketzis

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2011.2163353

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of game theory (91A80)

Recommendations

• Correction to “An Efficient Game Form for Unicast Service Provisioning” [Feb 12 392-404]
• Incentive Mechanism Design for Unicast Service Provisioning With Network Aggregative Game
• scientific article; zbMATH DE number 2183059
• Games with congestion-averse utilities
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing
• Totally unimodular congestion games
• Game-theoretic approach to the optimization of FDDI computer networks
• On the price of stability of undirected multicast games
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games

Cited in

(6)

• Almost budget balanced mechanisms with scalar bids for allocation of a divisible good
• An efficient dynamic allocation mechanism for security in networks of interdependent strategic agents
• Mechanism design for demand management in energy communities
• Auction-based distributed efficient economic operations of microgrid systems
• Correction to “An Efficient Game Form for Unicast Service Provisioning” [Feb 12 392-404]
• Parallel demand side auction mechanism for dynamic and efficient resource allocation

This page was built for publication: An Efficient Game Form for Unicast Service Provisioning

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