The role of a-priori information in networks of rational agents

DOI10.4230/LIPICS.DISC.2018.5MaRDI QIDQ5090894zbMATH OpenFDO

Authors Yehuda Afek, Shaked Rafaeli, Moshe Sulamy

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1910.02239

zbMATH Keywords

coloringdistributed game theoryknowledge sharingrational agents

Mathematics Subject Classification ID

Distributed systems (68M14) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15) Rationality and learning in game theory (91A26) Algorithmic game theory and complexity (91A68)

Recommendations

• Reaching distributed equilibrium with limited ID space
• Distributed computing building blocks for rational agents
• A knowledge-based analysis of global function computation
• A Knowledge-Based Analysis of Global Function Computation
• Selfish Load Balancing Under Partial Knowledge

Cites work

• Byzantine agreement with a rational adversary
• Cheap talk in games with incomplete information.
• Completely fair SFE and coalition-safe cheap talk
• Computational Complexity and Communication: Coordination in Two-Player Games
• Computationally restricted unmediated talk under incomplete information
• Deterministic coin tossing with applications to optimal parallel list ranking
• Distributed computing building blocks for rational agents
• Distributed computing meets game theory
• Distributed protocols for leader election: a game-theoretic perspective
• Efficient rational secret sharing in standard communication networks
• Fair Distribution Protocols or How the Players Replace Fortune
• Fair leader election for rational agents in asynchronous rings and networks
• How to share a secret
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 1759774 (Why is no real title available?)
• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• Hybrid consensus: efficient consensus in the permissionless model
• Legal coloring of graphs
• Locality based graph coloring
• Locality in Distributed Graph Algorithms
• Lower Bounds on Implementing Robust and Resilient Mediators
• Non-cooperative computation: Boolean functions with correctness and exclusivity
• On the complexity of distributed graph coloring
• Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics
• Rational consensus (extended abstract)
• Rational Secret Sharing, Revisited
• Rationality and Adversarial Behavior in Multi-party Computation
• Reaching distributed equilibrium with limited ID space
• Scalable rational secret sharing
• The sleepy model of consensus
• When selfish meets evil, Byzantine players in a virus inoculation game

Cited in

(1)

• Reaching distributed equilibrium with limited ID space

This page was built for publication: The role of a-priori information in networks of rational agents

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