skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Intrachoice Dynamics Shape Social Decisions
Do people have well-defined social preferences waiting to be applied when making decisions? Or do they have to construct social decisions on the spot? If the latter, how are those decisions influenced by the way in which information is acquired and evaluated? These temporal dynamics are fundamental to understanding how people trade off selfishness and prosociality in organizations and societies. Here, we investigate how the temporal dynamics of the choice process shape social decisions in three studies using response times and mouse tracking. In the first study, participants made binary decisions in mini-dictator games with and without time constraints. Using mouse trajectories and a starting time drift diffusion model, we find that, regardless of time constraints, selfish participants were delayed in processing others’ payoffs, whereas the opposite was true for prosocial participants. The independent mouse trajectory and computational modeling analyses identified consistent measures of the delay between considering one’s own and others’ payoffs (self-onset delay, SOD). This measure correlated with individual differences in prosociality and predicted heterogeneous effects of time constraints on preferences. We confirmed these results in two additional studies, one a purely behavioral study in which participants made decisions by pressing computer keys, and the other a replication of the mouse-tracking study. Together, these results indicate that people preferentially process either self or others’ payoffs early in the choice process. The intrachoice dynamics are crucial in shaping social preferences and might be manipulated via nudge policies (e.g., manipulating the display order or saliency of self and others’ outcomes) for behavior in managerial or other contexts. This paper was accepted by Yan Chen, behavioral economics and decisions analysis. Funding: F. Chen acknowledges support from the National Natural Science Foundation of China [Grants 71803174 and 72173113]. Z. Zhu acknowledges support from the Ministry of Science and Technology [Grant STI 2030-Major Projects 2021ZD0200409]. Q. Shen acknowledges support from the National Natural Science Foundation of China [Grants 71971199 and 71942004]. I. Krajbich acknowledges support from the U.S. National Science Foundation [Grant 2148982]. This work was also supported by the James McKeen Cattell Fund. Supplemental Material: The online appendix and data are available at https://doi.org/10.1287/mnsc.2023.4732 .  more » « less
Award ID(s):
2148982
PAR ID:
10435689
Author(s) / Creator(s):
; ; ; ;
Editor(s):
Chen, Yan
Date Published:
Journal Name:
Management Science
ISSN:
0025-1909
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; (, Management Science)
    Although leveraged exchange-traded funds (ETFs) are popular products for retail investors, how to hedge them poses a great challenge to financial institutions. We develop an optimal rebalancing (hedging) model for leveraged ETFs in a comprehensive setting, including overnight market closure and market frictions. The model allows for an analytical optimal rebalancing strategy. The result extends the principle of “aiming in front of target” introduced by Gârleanu and Pedersen (2013) from a constant weight between current and future positions to a time-varying weight because the rebalancing performance is monitored only at discrete time points, but the rebalancing takes place continuously. Empirical findings and implications for the weekend effect and the intraday trading volume are also presented. This paper was accepted by Agostino Capponi, finance. Funding: M. Dai acknowledges support from the National Natural Science Foundation of China [Grant 12071333], the Hong Kong Polytechnic University [Grant P0039114], and the Singapore Ministry of Education [Grants R-146-000-243/306/311-114 and R-703-000-032-112]. H. M. Soner acknowledges partial support from the National Science Foundation [Grant DMS 2106462]. C. Yang acknowledges support from the Chinese University of Hong Kong [Grant 4055132 and a University Startup Grant]. Supplemental Material: Data and the online supplement are available at https://doi.org/10.1287/mnsc.2022.4407 . 
    more » « less
  2. ; ; ; (, Management Science)
    In many operations management problems, we need to make decisions sequentially to minimize the cost, satisfying certain constraints. One modeling approach to such problems is the constrained Markov decision process (CMDP). In this work, we develop a data-driven primal-dual algorithm to solve CMDPs. Our approach alternatively applies regularized policy iteration to improve the policy and subgradient ascent to maintain the constraints. Under mild regularity conditions, we show that the algorithm converges at rate [Formula: see text], where T is the number of iterations, for both the discounted and long-run average cost formulations. Our algorithm can be easily combined with advanced deep learning techniques to deal with complex large-scale problems with the additional benefit of straightforward convergence analysis. When the CMDP has a weakly coupled structure, our approach can further reduce the computational complexity through an embedded decomposition. We apply the algorithm to two operations management problems: multiclass queue scheduling and multiproduct inventory management. Numerical experiments demonstrate that our algorithm, when combined with appropriate value function approximations, generates policies that achieve superior performance compared with state-of-the-art heuristics. This paper was accepted by Baris Ata, stochastic models and simulation. Funding: Y. Chen was supported by the Hong Kong Research Grants Council, Early Career Scheme Fund [Grant 26508924], and partially supported by a grant from the National Natural Science Foundation of China [Grant 72495125]. J. Dong was supported by the National Science Foundation [Grant 1944209]. Supplemental Material: The data files are available at https://doi.org/10.1287/mnsc.2022.03736 . 
    more » « less
  3. ; (, Mathematics of Operations Research)
    We provide tools to analyze information design problems subject to constraints. We do so by extending an insight by Le Treust and Tomala to the case of multiple inequality and equality constraints. Namely, that an information design problem subject to constraints can be represented as an unconstrained information design problem with additional states, one for each constraint. Thus, without loss of generality, optimal solutions induce as many posteriors as the number of states and constraints. We provide results that refine this upper bound. Furthermore, we provide conditions under which there is no duality gap in constrained information design, thus validating a Lagrangian approach. We illustrate our results with applications to mechanism design with limited commitment and persuasion of a privately informed receiver. Funding: L. Doval acknowledges the support of the National Science Foundation through [Grant SES-2131706]. V. Skreta acknowledges the support from the National Science Foundation through [Grant SES-1851729] and from the European Research Council (ERC) through consolidator [Grant 682417]. Supplemental Material: The e-companion is available at https://doi.org/10.1287/moor.2022.1346 . 
    more » « less
  4. ; ; ; ; ; ; ; (, New phytologist)
    Since its publication, the authors of Wang et al. (2021) have brought to our attention an error in their article. A grant awarded by the National Science Foundation (grant no. MCB 1817985) to author Elizabeth Vierling was omitted from the Acknowledgements section. The correct Acknowledgements section is shown below. Acknowledgements We thank Suiwen Hou (Lanzhou University) and Zhaojun Ding (Shandong University) for providing the seeds used in this study. We thank Xiaoping Gou (Lanzhou University) and Ravishankar Palanivelu (University of Arizona) for critically reading the manuscript and for suggestions regarding the article. This work was supported by grants from National Natural Science Foundation of China (31870298) to SX, the US Department of Agriculture (USDA-CSREES-NRI-001030) and the National Science Foundation (MCB 1817985) to EV, and the Youth 1000-Talent Program of China (A279021801) to LY. 
    more » « less
  5. ; ; (, Mathematics of Operations Research)
    In this paper, we study the generalized subdifferentials and the Riemannian gradient subconsistency that are the basis for non-Lipschitz optimization on embedded submanifolds of [Formula: see text]. We then propose a Riemannian smoothing steepest descent method for non-Lipschitz optimization on complete embedded submanifolds of [Formula: see text]. We prove that any accumulation point of the sequence generated by the Riemannian smoothing steepest descent method is a stationary point associated with the smoothing function employed in the method, which is necessary for the local optimality of the original non-Lipschitz problem. We also prove that any accumulation point of the sequence generated by our method that satisfies the Riemannian gradient subconsistency is a limiting stationary point of the original non-Lipschitz problem. Numerical experiments are conducted to demonstrate the advantages of Riemannian [Formula: see text] [Formula: see text] optimization over Riemannian [Formula: see text] optimization for finding sparse solutions and the effectiveness of the proposed method. Funding: C. Zhang was supported in part by the National Natural Science Foundation of China [Grant 12171027] and the Natural Science Foundation of Beijing [Grant 1202021]. X. Chen was supported in part by the Hong Kong Research Council [Grant PolyU15300219]. S. Ma was supported in part by the National Science Foundation [Grants DMS-2243650 and CCF-2308597], the UC Davis Center for Data Science and Artificial Intelligence Research Innovative Data Science Seed Funding Program, and a startup fund from Rice University. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email