Information Design for Congested Social Services: Optimal Need-Based Persuasion
Published Online:14 Oct 2022https://doi.org/10.1287/mnsc.2022.4548
Supplemental Material
The replication files for this article are available HERE.
- Cited by
- 24 June 2026 | IISE Transactions
- 1 June 2026 | Naval Research Logistics (NRL), Vol. 69
- 4 February 2026 | Manufacturing & Service Operations Management, Vol. 28, No. 3
- 6 January 2026 | Operations Research, Vol. 74, No. 3
- 20 March 2026 | Journal of the Operational Research Society
- 8 December 2025 | Manufacturing & Service Operations Management, Vol. 28, No. 2
- 12 November 2025 | Operations Research, Vol. 74, No. 2
- 11 November 2024 | Management Science, Vol. 71, No. 8
- Transportation Research Part E: Logistics and Transportation Review, Vol. 199
- Transportation Research Part B: Methodological, Vol. 196
- Journal of Construction Engineering and Management, Vol. 151, No. 5
- European Journal of Operational Research, Vol. 322, No. 1
- Expert Systems with Applications, Vol. 263
- 22 March 2024 | SIMULATION, Vol. 100, No. 10
- 5 January 2024 | Operations Research, Vol. 72, No. 5
- 11 September 2023 | Management Science, Vol. 70, No. 7
- 21 March 2024 | Production and Operations Management, Vol. 33, No. 5
- Transportation Research Part A: Policy and Practice, Vol. 176
- 1 January 2023 | SSRN Electronic Journal, Vol. 32
- SSRN Electronic Journal, Vol. 7
- SSRN Electronic Journal, Vol. 14
Volume 69, Issue 7
July 2023
Pages 3759-4361, iii-iv
Article Information
Supplemental Material
Metrics
Information
- Received:August 13, 2020
- Accepted:January 12, 2022
- Published Online:October 14, 2022
Copyright © 2022, INFORMS
Cite as
Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh Manshadi (2022) Information Design for Congested Social Services: Optimal Need-Based Persuasion. Management Science 69(7):3778-3796.
https://doi.org/10.1287/mnsc.2022.4548
Keywords
The authors thank the department editor, the anonymous associate editor, and the reviewers for their constructive feedback. A preliminary version of this work appeared as an extended abstract in the proceedings of the 21st ACM Conference on Economics and Computation (EC’20), and we are grateful to the anonymous reviewers and conference participants for their valuable comments. The third author gratefully acknowledges the Simons Institute for the Theory of Computing, as this work was done in part while the author attended the program on Online and Matching-Based Market Design.
