Computing the Common Prior
Dov Samet (1998) showed that a finite type space achieves a common prior if and only if there is no agreeable bet in it. We also consider finite type spaces and demonstrate that finding a common prior or an agreeable bet is a strongly polynomial problem.
Joint work with Marianna E.-Nagy
To view the seminar recording, click here
תאריך עדכון אחרון : 05/01/2021