Specification faithfulness in networks with rational nodes

DOI10.1145/1011767.1011781MaRDI QIDQ5501487zbMATH OpenOpenAlexFDO

Authors Jeffrey Shneidman, David C. Parkes

Publication date 3 August 2015

Published in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://nrs.harvard.edu/urn-3:HUL.InstRepos:4054443

zbMATH Keywords

incentive compatibilitycomputational mechanism designfailure modelsdistributed algorithmic mechanism designalgorithm compatibilitycommunication compatibilityrational failurerational manipulation

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Distributed algorithms (68W15) Other game-theoretic models (91A40) Distributed systems (68M14) Network protocols (68M12)

Recommendations

• Incentive-compatible interdomain routing
• Rationality in the Full-Information Model
• Incentive-compatible interdomain routing with linear utilities
• Interdomain Routing and Games
• Distributed algorithmic mechanism design

Cited in

(6)

• Rationality in the Full-Information Model
• An incentive-based distributed mechanism for scheduling divisible loads in tree networks
• Secure message transmission on directed networks
• Incentive-compatible interdomain routing
• A BGP-based mechanism for lowest-cost routing
• Distributed algorithmic mechanism design for scheduling on unrelated machines

This page was built for publication: Specification faithfulness in networks with rational nodes

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