Distributed computing meets game theory

DOI10.1145/1146381.1146393zbMath1314.68051OpenAlexW2077734015MaRDI QIDQ5177264

Danny Dolev, Joe Halpern, Rica Gonen, Ittai Abraham

Publication date: 10 March 2015

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

Full work available at URL: https://doi.org/10.1145/1146381.1146393

zbMATH Keywords

game theory distributed computing secret sharing secure multiparty computation

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (44)

Strong mediated equilibrium ⋮ Bayesian mechanism for rational secret sharing scheme ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Synthesis with rational environments ⋮ Toward a game theoretic view of secure computation ⋮ Revisiting asynchronous fault tolerant computation with optimal resilience ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Correlation and unmediated cheap talk in repeated games with imperfect monitoring ⋮ Outcome-robust mechanisms for Nash implementation ⋮ \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks ⋮ Decentralisation conscious players and system reliability ⋮ Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Data curation from privacy-aware agents ⋮ Verifiable crowd computing: coping with bounded rationality ⋮ Utility dependence in correct and fair rational secret sharing ⋮ Resilient Information Aggregation ⋮ Rational quantum secret sharing scheme based on GHZ state ⋮ A detail-free mediator ⋮ Crowd computing as a cooperation problem: An evolutionary approach ⋮ Secure message transmission on directed networks ⋮ Optimal strategies for selecting coordinators ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Protocol completion incentive problems in cryptographic Vickrey auctions ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Communication, correlation and cheap-talk in games with public information ⋮ A rational framework for secure communication ⋮ Algorithmic rationality: game theory with costly computation ⋮ Unmediated communication with partially verifiable types ⋮ Nash equilibria in stabilizing systems ⋮ Fault tolerance in large games ⋮ Minority-proof cheap-talk protocol ⋮ Unnamed Item ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Strong price of anarchy ⋮ Robust Equilibria in Mean-Payoff Games ⋮ Aggregatable distributed key generation ⋮ Beyond Nash Equilibrium: Solution Concepts for the 21st Century ⋮ Rationality in the Full-Information Model ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ Scalable mechanisms for rational secret sharing

This page was built for publication: Distributed computing meets game theory