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: Constrained Information Design
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
Award ID(s):
2131706
PAR ID:
10483163
Author(s) / Creator(s):
;
Publisher / Repository:
Mathematics of Operations Research
Date Published:
Journal Name:
Mathematics of Operations Research
ISSN:
0364-765X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, Management Science)
    Chen, Yan (Ed.)
    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
  2. ; ; ; (, 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
  3. ; ; (, Mathematics of Operations Research)
    D-optimal experimental design is a classical statistical problem in which one chooses a collection of data vectors, from some available large pool, in order to maximize a measure of predictive quality. In the classical formulation, the only constraint is on the cardinality of the collection, that is, the number of vectors chosen. We study a more general budget-constrained variant in which vectors have heterogeneous costs, and develop four new algorithms (two deterministic and two randomized) with approximation guarantees. Our methods handle heterogeneous costs using a novel exchange rule that interchanges packs of data vectors whose total costs are similar (up to some controlled amount of rounding error). The algorithms outperform the only existing method for this problem from both theoretical and empirical standpoints. Funding: The first and third authors gratefully acknowledge support from the National Science Foundation (NSF) Division of Civil, Mechanical and Manufacturing Innovation [Grant CMMI-2112828]. The second author gratefully acknowledges support from the NSF Division of Computing and Communication Foundations [Grant CCF-2246417] and Office of Naval Research [Grant N00014-24-1-2066]. 
    more » « less
  4. ; ; ; (, Information Systems Research)
    We use high-resolution mobile phone data with geolocation information and propose a novel technical framework to study how social influence propagates within a phone communication network and affects the offline decision to attend a performance event. Our fine-grained data are based on the universe of phone calls made in a European country between January and July 2016. We isolate social influence from observed and latent homophily by taking advantage of the rich spatial-temporal information and the social interactions available from the longitudinal behavioral data. We find that influence stemming from phone communication is significant and persists up to four degrees of separation in the communication network. Building on this finding, we introduce a new “influence” centrality measure that captures the empirical pattern of influence decay over successive connections. A validation test shows that the average influence centrality of the adopters at the beginning of each observational period can strongly predict the number of eventual adopters and has a stronger predictive power than other prevailing centrality measures such as the eigenvector centrality and state-of-the-art measures such as diffusion centrality. Our centrality measure can be used to improve optimal seeding strategies in contexts with influence over phone calls, such as targeted or viral marketing campaigns. Finally, we quantitatively demonstrate how raising the communication probability over each connection, as well as the number of initial seeds, can significantly amplify the expected adoption in the network and raise net revenue after taking into account the cost of these interventions. History: Sam Ransbotham, Senior Editor; Yan Huang, Associate Editor. Funding: Y. Leng acknowledges the support provided by the National Science Foundation [Grant IIS-2153468]. E. Moro acknowledges the support provided by the National Science Foundation [Grant 2218748]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/isre.2023.1231 . 
    more » « less
  5. ; ; ; ; (, Transportation Science)
    The lack of a unique user equilibrium (UE) route flow in traffic assignment has posed a significant challenge to many transportation applications. The maximum-entropy principle, which advocates for the consistent selection of the most likely solution, is often used to address the challenge. Built on a recently proposed day-to-day discrete-time dynamical model called cumulative logit (CumLog), this study provides a new behavioral underpinning for the maximum-entropy user equilibrium (MEUE) route flow. It has been proven that CumLog can reach a UE state without presuming that travelers are perfectly rational. Here, we further establish that CumLog always converges to the MEUE route flow if (i) travelers have no prior information about routes and thus, are forced to give all routes an equal initial choice probability or if (ii) all travelers gather information from the same source such that the general proportionality condition is satisfied. Thus, CumLog may be used as a practical solution algorithm for the MEUE problem. To put this idea into practice, we propose to eliminate the route enumeration requirement of the original CumLog model through an iterative route discovery scheme. We also examine the discrete-time versions of four popular continuous-time dynamical models and compare them with CumLog. The analysis shows that the replicator dynamic is the only one that has the potential to reach the MEUE solution with some regularity. The analytical results are confirmed through numerical experiments. History: This paper has been accepted for the Transportation Science Special Issue on ISTTT25 Conference. Funding: This research was funded by the United States National Science Foundation’s Division of Civil, Mechanical and Manufacturing Innovation [Grant 2225087]. The work of J. Xie was funded by the National Natural Science Foundation of China [Grant 72371205]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2024.0525 . 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email