Persuasion and dynamic communication
From MaRDI portal
Publication:4585998
DOI10.3982/TE683zbMATH Open1395.91069MaRDI QIDQ4585998FDOQ4585998
Publication date: 11 September 2018
Published in: Theoretical Economics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Maximal Flow Through a Network
- Mediation, arbitration and negotiation
- Title not available (Why is that?)
- Strategic Information Transmission
- The Complexity of Computing a Nash Equilibrium
- Long Cheap Talk
- The art of conversation: eliciting information from experts through multi-stage communication
- Computational Complexity
- New complexity results about Nash equilibria
- Disclosures and Asset Returns
- Robust inference in communication games with partial provability
- Implementation with evidence
- Title not available (Why is that?)
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Partially Verifiable Information and Mechanism Design
- Debates and decisions: On a rationale of argumentation rules.
- Nash and correlated equilibria: Some complexity considerations
- The burden of proof in a game of persuasion
- Mechanism design with partial state verifiability
- Communication equilibria with partially verifiable types
- The Optimal Amount of Discretion to Allow in Disclosure
- Implementation with partial provability
- On Optimal Rules of Persuasion
- Evidence disclosure and verifiability
- Hard evidence and mechanism design
- Credibility and determinism in a game of persuasion
- Implementation with partial verification
- Strategic argumentation
- EFFECTIVE PERSUASION
- Title not available (Why is that?)
Cited In (7)
This page was built for publication: Persuasion and dynamic communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4585998)