Reputational Bargaining Under Knowledge of Rationality

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=zBDcy4Y5WXY



Duration: 1:02:50
40 views
0


Two players announce bargaining postures to which they may become committed and then bargain over the division of a surplus. The share of the surplus that a player can guarantee herself under first-order knowledge of rationality is determined (as a function of her probability of becoming committed), as is the bargaining posture that she must announce in order to guarantee herself this much. This 'maxmin' share of the surplus is large relative to the probability of becoming committed (e.g., it equals 30 if the commitment probability is 1 in 1 million), and the corresponding bargaining posture simply demands this share plus compensation for any delay in reaching agreement. I also consider whether a larger share can be guaranteed if there is higher-order knowledge of rationality, and relate the outcome of the model to the outcomes of a broad class of discrete-time bargaining procedures with frequent offers.




Other Videos By Microsoft Research


2016-08-16The Reconstruction Problem on the Tree
2016-08-16Information and Interactive Communication
2016-08-16The Impact of Visualization on Search and Discovery; ScienceCinema; Speech Processing Quaero
2016-08-16Interactive Illustrations; Delivering Interactive 3D Moleculars; Interactive Multimedia Publishing
2016-08-16Semantics of Innovation in Visualization; PivotViewer; Visualization of Ecological Data
2016-08-16Telling Stories in the Cloud; Communications from the Particle Frontier; Video Analytics
2016-08-16On Users' Mental Models of Security Controls
2016-08-16Why Don't Software Developers Use their Tools?
2016-08-16The Mathematics of Side-Channel Attacks
2016-08-16PyPy's Approach to Implementing Dynamic Languages Using a Tracing JIT Compiler
2016-08-16Reputational Bargaining Under Knowledge of Rationality
2016-08-16We Will be Right With You: Managing Customers Expectations with Vague Promises and Cheap Talk
2016-08-16Information That Matters: Investigating Relevance of Entities in Social Media Networks
2016-08-16Efficient Bayesian Algorithmic Mechanism Design
2016-08-16Extreme Learning Machine: Learning Without Iterative Tuning
2016-08-16Extracting Knowledge from Networks: Rumors, Superstars, and Communities
2016-08-16Electrical Flows and Laplacian Systems: A New Tool for Graph Algorithms
2016-08-16Limit Theorems in Pseudorandomness and Learning Theory
2016-08-16Empirical Software Engineering, Version 2.0
2016-08-16A Master Bijection for Planar Maps, and Its Applications
2016-08-16Password-based Authenticated Key Exchange at the Cost of Diffie-Hellman



Tags:
microsoft research