scientific article; zbMATH DE number 1759774
From MaRDI portal
Publication:4536797
Recommendations
Cited in
(27)- A solution of the misère Shannon switching game
- Game theoretic notions of fairness in multi-party coin toss
- Solution of the Hotelling's game in secure strategies
- A complete characterization of game-theoretically fair, multi-party coin toss
- Algorithmic rationality: game theory with costly computation
- Computer science and decision theory
- A rational approach to cryptographic protocols
- Communication optimal Tardos-based asymmetric fingerprinting
- A uniform min-max theorem with applications in cryptography
- Limits on the power of cryptographic cheap talk
- Toward a game theoretic view of secure computation
- When is a semi-honest secure multiparty computation valuable?
- A quantum protocol for sampling correlated equilibria unconditionally and without a mediator
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Efficient Correlated Action Selection
- Cryptography and game theory
- Financial Cryptography
- A rational framework for secure communication
- The role of a-priori information in networks of rational agents
- Correlated equilibria and communication in games
- scientific article; zbMATH DE number 5879525 (Why is no real title available?)
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- \(\log^\ast\)-round game-theoretically-fair leader election
- Perfect implementation
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- A simple model of secure public communication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536797)
