1) Global coordination under Monotone Sampling (SSRN, download, presentation). Joint with Srinivas Arigapudi.
Idea: The paper unifies many models of learning and shows that when new agents learn from independent samples using a shared monotone rule, coordination always wins.
2) Meritocratic Lotteries under Intersectional Diversity Quotas (SSRN, download). Joint with Ron Peretz and Amnon Schreiber.
Idea: The paper shows how lotteries can preserve each person’s intended chance of selection while satisfying—or nearly satisfying—intersectional diversity quotas in the final group.
3) Strategies in the repeated prisoner's dilemma: A cluster analysis (download, GitHub data and code). Joint with Itay Tubul. Revision requested at Games & Economic Beahvior.
Idea: We apply a new technique of cluster analysis to study which strategies are used in experiments of the infinitely repeated prisoner's dilemma.
4) Miscoordination under sample-based learning (SSRN, download). Joint with Srinivas Arigapudi.
Idea: Small-sample learning can trap groups in mismatch, especially when experience levels differ or people care a lot about what others do.
5) The Hhdden advantage of loss: Evidence from chess (SSRN, download). Joint with Itay Tubul.
Idea: Chess players play better after losing, suggesting setbacks can sharpen performance.
6) Uniqueness of inflection points in binomial exceedance function compositions (GDrive download). Joint with Srinivas Arigapudi and Amnon Schreiber. Revision requested at Examples and Counterexamples.
Idea: We show that compositions of binomial exceedance functions have unique inflection points, and discuss the interesting implications of this property.