Distributed computing meets game theory
From MaRDI portal
Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) 2-person games (91A05) (n)-person games, (n>2) (91A06) Noncooperative games (91A10) Authentication, digital signatures and secret sharing (94A62)
Recommendations
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Rational secret sharing and multiparty computation
- Towards a game theoretic view of secure computation
- Scalable mechanisms for rational secret sharing
- Toward a game theoretic view of secure computation
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
- Theory and Practice of Multiparty Computation
- Secure multiparty computation and secret sharing
- Privacy stochastic games in distributed constraint reasoning
- Equilibrium concepts for rational multiparty computation
Cited in
(68)- Strong price of anarchy
- Game theoretic notions of fairness in multi-party coin toss
- Dogfish: decentralized optimistic game-theoretic file sharing
- Correlation and unmediated cheap talk in repeated games with imperfect monitoring
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
- Crowd computing as a cooperation problem: An evolutionary approach
- Fault tolerance in large games
- Aggregatable distributed key generation
- Revisiting asynchronous fault tolerant computation with optimal resilience
- A complete characterization of game-theoretically fair, multi-party coin toss
- An application of crypto cloud computing in social networks by cooperative game theory
- Optimal strategies for selecting coordinators
- Algorithmic rationality: game theory with costly computation
- Scalable mechanisms for rational secret sharing
- Outcome-robust mechanisms for Nash implementation
- Utility dependence in correct and fair rational secret sharing
- A detail-free mediator
- Secure message transmission on directed networks
- Overcoming free riding in multi-party computations -- the anonymous case
- Non-cooperative computation: Boolean functions with correctness and exclusivity
- Rational quantum secret sharing scheme based on GHZ state
- Robust equilibria in mean-payoff games
- Beyond Nash equilibrium: solution concepts for the 21st century
- Synthesis with rational environments
- Equilibrium concepts for rational multiparty computation
- Toward a game theoretic view of secure computation
- When is a semi-honest secure multiparty computation valuable?
- Perfectly secure message transmission against independent rational adversaries
- Rationality in the Full-Information Model
- Efficient rational secret sharing in standard communication networks
- Rational secret sharing and multiparty computation
- Robust and scalable middleware for selfish-computer systems
- scientific article; zbMATH DE number 1857530 (Why is no real title available?)
- A rational framework for secure communication
- Bayesian mechanism for rational secret sharing scheme
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
- The role of a-priori information in networks of rational agents
- Unmediated communication with partially verifiable types
- Distributed Computing
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Nash equilibria in stabilizing systems
- Rationality and Adversarial Behavior in Multi-party Computation
- Economically optimal variable tag length message authentication
- \textsc{Hide} \& \textsc{Seek}: privacy-preserving rebalancing on payment channel networks
- Decentralisation conscious players and system reliability
- \(\log^\ast\)-round game-theoretically-fair leader election
- Data curation from privacy-aware agents
- Game-Theoretic Analysis of an Incentivized Verifiable Computation System
- Verifiable crowd computing: coping with bounded rationality
- Resilient Information Aggregation
- Beyond dominance and Nash: ranking equilibria by critical mass
- Verifiable crowd computing: coping with bounded rationality
- A game theoretic framework for distributed computing with dynamic set of agents
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- Communication games, sequential equilibrium, and mediators
- Communication, correlation and cheap-talk in games with public information
- Viable Nash equilibria: an experiment
- Attaining equilibria using control sets
- Maximizing miner revenue in transaction fee mechanism design
- Attaining equilibria using control sets
- Bounding the communication complexity of fault-tolerant common coin tossing
- Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents
- Game-theoretically fair coin toss with arbitrary preferences
- Rational secret sharing with competition
- Game theory does not always help: the case of statistical multi-party coin tossing
- Strong mediated equilibrium
- Protocol completion incentive problems in cryptographic Vickrey auctions
- Minority-proof cheap-talk protocol
This page was built for publication: Distributed computing meets game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177264)
