INFORMS Expository Writing Award
It is with great pleasure that the INFORMS Committee for the Expository Writing Award names the late Professor Uriel G. Rothblum of the Technion-Israel Institute of Technology as the recipient of its 2012 award. Uriel Rothblum was the author or co-author of more than 160 journal articles addressing such diverse theoretical areas as linear algebra, optimization, dynamic programming, networks, economics, game theory, and applied probability as well as applications to problems found in homeland security and the management of competitive research and development. In addition to these many journal publications, he co-authored (with Frank Hwang) the bookPartitions: Optimality and Clustering(World Scientific, 2012).
Professor Rothblum’s most-cited paper is “Algebraic Eigenspaces of Nonnegative Matrices” (Linear Algebra and its Applications, 1975). This paper generalizes the famous Perron-Frobenius theorem regarding the dominant eigenvalue of irreducible nonnegative square matrices toarbitrarynonnegative square matrices. While deriving results in a paper this technical is difficult enough, communicating them clearly requires the careful, concise and precise writing for which Professor Rothblum is known.
An insightful marriage of theory and application is Professor Rothblum’s beautifully written paper with Alvin Roth entitled “Truncation Strategies in Matching Markets – In Search of Advice for Participants” (Econometrica, 1999). Models of matching markets such as those that pair medical residents with hospitals suggest that some residents could improve their individual outcomes by misrepresenting their true preferences. The curious result of this article is that when participants know little about the preferences of others, a good strategy to employ is truncation – that is, restrict the number of positions reported to something lower than the true number acceptable, but truthfully rank those positions that are reported. This paper is structured by moving from a description of matching markets, to a basic model, to a series of cleverly constructed “toy problems”, and finally to several clearly stated theorems together with a summary discussion. In this way, the paper successfully makes its points while heightening reader interest along the way.
Professor Rothblum was also interested in the relationship between optimal solutions in centralized resource allocation problems, and the corresponding equilibria in decentralized versions of the same resource allocation problems. Through the clever use of a system of linear penalties and rewards, Rothblum developed a method by which one could create a game whose equilibrium solution would correspond with the desired centralized optimal solution and thus coordinate the players in the game. This approach was detailed in his paper with Boaz Golany, “Inducing Coordination in Supply Chains through Linear Reward Schemes” (Naval Research Logistics, 2006). The idea is illustrated via a series of clearly and crisply written examples.
An innovative application of this idea in a dynamic setting appears in “A Generalized Two-Agent Location Problem: Asymmetric Dynamics and Coordination” (Journal of Optimization Theory and Applications, 2011, with Golany and Konstantin Kogan). This paper shows how two patrolling agents can coordinate their movement over time to achieve some objective without requiring a centralized controller that yields equivalent results to those that could be achieved via centralized control. The results qualify as superb while the paper itself unfolds like an adventure story.
From his earliest contributions until his untimely death in March of this year, Professor Rothblum tackled very difficult problems in both theoretical and applied mathematics and operations research, yet his writing was always patient and clear. His work exemplifies the art of technical writing, and has been very influential in both theory and applications. For these reasons, the Expository Writing Committee (Richard Steinberg, Edward H. Kaplan and Dimitris Bertsimas) is pleased to name Uriel G. Rothblum as the recipient of the 2012 INFORMS Expository Writing Award.
Purpose of the Award
The INFORMS Expository Writing Award honors an operations researcher/management scientist whose publications demonstrate a consistently high standard of expository writing. The award is given each year at the INFORMS National Meeting if there is a suitable recipient. The award consists of $2,000 and a framed certificate that includes a brief citation.
Past Awardees
| 2012 | Winner Uriel G. Rothblum, Technion-Israel Institute of Technology |
|---|---|
| 2011 | Winner Ward Whitt, Columbia University, Industrial Engineering & Operations Research Dept. |
| 2010 | Winner Edward H. Kaplan, Yale University |
| 2009 |
Winner
Dimitri P. Bertsekas,
Massachusetts Institute of Technology |
| 2008 | Winner Henk C. Tijms, Vrije University |
| 2007 | Winner Paul H. Zipkin, Duke University, Fuqua School of Business |
| 2006 | Winner Sheldon M. Ross, University of Southern California, Dept. of Industrial & Systems Engineering |
| 2005 |
Winner
Lawrence M. Wein,
Stanford University, Graduate School of Business |
| 2004 | Winner Frederick S. Hillier, Professor Emeritus of Operations Research, Stanford University |
| 2003 |
Winner
Erhan Çinlar,
Princeton University, Operations Research & Financial Engineering Dept. |
| 2002 | Winner Ralph L. Keeney, Fuqua School of Business, Duke University Howard Raiffa, Harvard University, Graduate School of Business Administration |
| 2001 | Winner Arnold I. Barnett, Massachusetts Institute of Technology, Sloan School of Management |
| 2000 | Winner John D.C. Little, Massachusetts Institute of Technology |
| 1999 | Winner David G. Luenberger, Management Science & Engineering Dept., Stanford University |
| 1998 | Winner J. Michael Harrison, Stanford University, Graduate School of Business |
| 1997 | Winner Saul I. Gass, University of Maryland, Robert H. Smith School of Business |
| 1996 | Winner Harvey M. Wagner, University of North Carolina - Chapel Hill, Kenan-Flagler Business School |

