Pages that link to "Item:Q5177264"
From MaRDI portal
The following pages link to Distributed computing meets game theory (Q5177264):
Displaying 40 items.
- Synthesis with rational environments (Q314471) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- A rational framework for secure communication (Q497644) (← links)
- Unmediated communication with partially verifiable types (Q533921) (← links)
- Nash equilibria in stabilizing systems (Q555314) (← links)
- Communication, correlation and cheap-talk in games with public information (Q665090) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Minority-proof cheap-talk protocol (Q980965) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Correlation and unmediated cheap talk in repeated games with imperfect monitoring (Q1684128) (← links)
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion (Q1938377) (← links)
- Crowd computing as a cooperation problem: An evolutionary approach (Q1953122) (← links)
- Fault tolerance in large games (Q2016249) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Revisiting asynchronous fault tolerant computation with optimal resilience (Q2166363) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Optimal strategies for selecting coordinators (Q2217494) (← links)
- Algorithmic rationality: game theory with costly computation (Q2253839) (← links)
- Scalable mechanisms for rational secret sharing (Q2355325) (← links)
- Outcome-robust mechanisms for Nash implementation (Q2417415) (← links)
- Utility dependence in correct and fair rational secret sharing (Q2429715) (← links)
- A detail-free mediator (Q2436299) (← links)
- Secure message transmission on directed networks (Q2442837) (← links)
- Rational quantum secret sharing scheme based on GHZ state (Q2693837) (← links)
- Robust Equilibria in Mean-Payoff Games (Q2811341) (← links)
- Beyond Nash Equilibrium: Solution Concepts for the 21st Century (Q3098090) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- Rationality in the Full-Information Model (Q3408207) (← links)
- Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
- Bayesian mechanism for rational secret sharing scheme (Q5046467) (← links)
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games (Q5056367) (← links)
- (Q5090894) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← links)
- Economically Optimal Variable Tag Length Message Authentication (Q5854434) (← links)
- Resilient Information Aggregation (Q6199595) (← links)
- Beyond dominance and Nash: ranking equilibria by critical mass (Q6494274) (← links)
