Playing Divide-and-Choose Given Uncertain Preferences

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions of those values are common knowledge. We consider both the cases of independent values and values that are correlated across players (as occurs when there is a common-value component). We describe the structure of optimal divisions in the divide-and-choose game and identify several cases where it is possible to efficiently compute equilibria. An approximation algorithm is presented for the case when the distribution over the chooser’s value for each good follows a normal distribution, along with a randomized approximation algorithm for the case of uniform distributions over intervals. A mixture of analytic results and computational simulations illuminates several striking differences between optimal strategies in the cases of known versus unknown preferences. Most notably, given unknown preferences, the divider has a compelling “diversification” incentive in creating the chooser’s two options. This incentive leads to multiple goods being divided at equilibrium, quite contrary to the divider’s optimal strategy when preferences are known. In many contexts, such as buy-and-sell provisions between partners, or in judging fairness, it is important to assess the relative expected utilities of the divider and chooser. Those utilities, we show, depend on the players’ levels of knowledge about each other’s values, the correlations between the players’ values, and the number of goods being divided. Under fairly mild assumptions, we show that the chooser is strictly better off for a small number of goods, whereas the divider is strictly better off for a large number of goods. This paper was accepted by Ilia Tsetlin, behavioral economics and decision analysis. Funding: This work was supported by the Mossavar-Rahmani Center for Business and Government, Harvard University, and the National Science Foundation [Grant DGE1745303]. Any opinions, findings, and conclusions or recommendations expressed in this material reflect the views of the authors and not necessarily those of the National Science Foundation or the Mossavar-Rahmani Center. Supplemental Material: The data files are available at https://doi.org/10.1287/mnsc.2023.00350 .

Authors

Institutions

Publication Details

Journal
Management Science
Published
2024-11-25
DOI
https://doi.org/10.1287/mnsc.2023.00350
Primary Topic
Game Theory and Voting Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Playing Divide-and-Choose Given Uncertain Preferences

Richard Zeckhauser, Jamie Tucker-Foltz
Management Science
Game Theory and Voting Systems
article

Playing Divide-and-Choose Given Uncertain Preferences

Richard Zeckhauser, Jamie Tucker-Foltz
article en

Abstract

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions of those values are common knowledge. We consider both the cases of independent values and values that are correlated across players (as occurs when there is a common-value component). We describe the structure of optimal divisions in the divide-and-choose game and identify several cases where it is possible to efficiently compute equilibria. An approximation algorithm is presented for the case when the distribution over the chooser’s value for each good follows a normal distribution, along with a randomized approximation algorithm for the case of uniform distributions over intervals. A mixture of analytic results and computational simulations illuminates several striking differences between optimal strategies in the cases of known versus unknown preferences. Most notably, given unknown preferences, the divider has a compelling “diversification” incentive in creating the chooser’s two options. This incentive leads to multiple goods being divided at equilibrium, quite contrary to the divider’s optimal strategy when preferences are known. In many contexts, such as buy-and-sell provisions between partners, or in judging fairness, it is important to assess the relative expected utilities of the divider and chooser. Those utilities, we show, depend on the players’ levels of knowledge about each other’s values, the correlations between the players’ values, and the number of goods being divided. Under fairly mild assumptions, we show that the chooser is strictly better off for a small number of goods, whereas the divider is strictly better off for a large number of goods. This paper was accepted by Ilia Tsetlin, behavioral economics and decision analysis. Funding: This work was supported by the Mossavar-Rahmani Center for Business and Government, Harvard University, and the National Science Foundation [Grant DGE1745303]. Any opinions, findings, and conclusions or recommendations expressed in this material reflect the views of the authors and not necessarily those of the National Science Foundation or the Mossavar-Rahmani Center. Supplemental Material: The data files are available at https://doi.org/10.1287/mnsc.2023.00350 .

Management ScienceVol. 71(8)
Harvard University (US)
Peace, Justice and strong institutions
Openalex Percentile: Top 74%
Game Theory and Voting Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.