Filter Results:
(1,918)
Show Results For
- All HBS Web
(1,918)
- People (2)
- News (215)
- Research (1,370)
- Events (15)
- Multimedia (13)
- Faculty Publications (906)
Show Results For
- All HBS Web
(1,918)
- People (2)
- News (215)
- Research (1,370)
- Events (15)
- Multimedia (13)
- Faculty Publications (906)
- 1977
- Article
On the Joint Distribution of Left- and Right-sided Outliner Statistics
By: André Perold and D. M. Hawkins
Keywords: Mathematical Methods
Perold, André, and D. M. Hawkins. "On the Joint Distribution of Left- and Right-sided Outliner Statistics." Utilitas mathematica 12 (1977): 129–143.
- 1982
- Chapter
Informal Covariation Assessment: Data-based vs. Theory-based Judgements
By: D. Jennings, T. M. Amabile and L. D. Ross
Keywords: Mathematical Methods
- November 1993
- Article
Stable Matchings, Optimal Assignments, and Linear Programming
By: A. E. Roth, U. G. Rothblum and J. H. Vande Vate
Keywords: Mathematical Methods
Roth, A. E., U. G. Rothblum, and J. H. Vande Vate. "Stable Matchings, Optimal Assignments, and Linear Programming." Mathematics of Operations Research 18, no. 4 (November 1993): 803–828.
- 2013
- Article
Beyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux
By: Nihal Gowravaram and Ravi Jagadeesan
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West’s notion of shape-Wilf equivalence to apply to alternating... View Details
Keywords: Pattern Avoidance; Alternating Permutations; Descent Type Permutations; Wilf Equivalence; Shape-Wilf Equivalence; Mathematical Methods
Gowravaram, Nihal, and Ravi Jagadeesan. "Beyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux." #P17. Electronic Journal of Combinatorics 20, no. 4 (2013).
- Article
Hinged Dissections Exist
By: Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine and Scott Duke Kominers
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form... View Details
Abbott, Timothy G., Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, and Scott Duke Kominers. "Hinged Dissections Exist." Discrete & Computational Geometry 47, no. 1 (January 2012): 150–186.
- May 2009
- Article
Configurations of Extremal Even Unimodular Lattices
We extend the results of Ozeki on the configurations of extremal even unimodular lattices. Specifically, we show that if L is such a lattice of rank 56, 72, or 96, then L is generated by its minimal-norm vectors. View Details
Keywords: Mathematical Methods
Kominers, Scott Duke. "Configurations of Extremal Even Unimodular Lattices." International Journal of Number Theory 5, no. 3 (May 2009): 457–464.
- 2010
- Article
On the Classification of Type II Codes of Length 24
By: Noam D. Elkies and Scott Duke Kominers
We give a new, purely coding-theoretic proof of Koch's criterion on the tetrad systems of Type II codes of length 24 using the theory of harmonic weight enumerators. This approach is inspired by Venkov's approach to the classification of the root systems of Type II... View Details
Keywords: Mathematical Methods
Elkies, Noam D., and Scott Duke Kominers. "On the Classification of Type II Codes of Length 24." SIAM Journal on Discrete Mathematics 23, no. 4 (2010).
- March 2010
- Article
Further Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
By: Shaofang Hong and Scott Duke Kominers
For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >= a and n >=... View Details
Keywords: Mathematical Methods
Hong, Shaofang, and Scott Duke Kominers. "Further Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions." Proceedings of the American Mathematical Society 138, no. 3 (March 2010): 809–813.
- August 2005 (Revised April 2008)
- Teaching Note
GuestFirst Hotel (B): Statistics Review with Data Desk (TN)
By: Frances X. Frei
Presents an overview of the statistical analysis covered in the case discussion. View Details
- March 2004
- Teaching Note
Variance Analysis Tutorial (Instructor Guide)
By: David F. Hawkins
Instructor Guide to (9-104-709). View Details
Keywords: Mathematical Methods
- October 1979 (Revised March 1995)
- Background Note
Note on the Management of Queues
Contains four sections: 1) measuring the performance of queuing systems; 2) types of queuing systems; 3) the behavior of simple systems (elementary queuing theory); and 4) the management of queues (including a discussion of their psychology). View Details
Keywords: Mathematical Methods
Maister, David H. "Note on the Management of Queues." Harvard Business School Background Note 680-053, October 1979. (Revised March 1995.)
- 1997
- Chapter
On the Role of the Wiener Process in Finance Theory and Practice: The Case of Replicating Portfolios
By: Robert C. Merton
Keywords: Mathematical Methods
Merton, Robert C. "On the Role of the Wiener Process in Finance Theory and Practice: The Case of Replicating Portfolios." In The Legacy of Norbert Wiener: A Centennial Symposium. Vol. 60, edited by D. Jerison, I. M. Singer, and D. W. Stroock. Proceedings of Symposia in Pure Mathematics . Providence, RI: American Mathematical Society, 1997.
- 19 Oct 2017
- Working Paper Summaries
Games of Threats
- 28 Mar 2023
- Blog Post
Meet Professor Elisabeth Paulson: A Conversation on Life, Research, and Teaching
non-experts can similarly promote classroom learning by asking and answering questions. This creates a unique and supportive classroom culture. Your research focuses on data-driven policy making and the design of interventions for social... View Details
- Article
Games of Threats
By: Elon Kohlberg and Abraham Neyman
A game of threats on a finite set of players, N, is a function d that assigns a real number to any coalition, S ⊆ N, such that d(S) = -d(N\S). A game of threats is not necessarily a coalitional game as it may fail to satisfy the condition d(Ø) = 0. We show that analogs... View Details
Kohlberg, Elon, and Abraham Neyman. "Games of Threats." Games and Economic Behavior 108 (March 2018): 139–145.
- 2024
- Article
A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in Quadratic Time
By: Zachary Abel, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman and Frederick Stock
In the modular robot reconfiguration problem we are given n cube-shaped modules (or "robots") as well as two configurations, i.e., placements of the n modules so that their union is face-connected. The goal is to find a sequence of moves that reconfigures the modules... View Details
Abel, Zachary, Hugo A. Akitaya, Scott Duke Kominers, Matias Korman, and Frederick Stock. "A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in Quadratic Time." Proceedings of the International Symposium on Computational Geometry (SoCG) 40th (2024): 1:1–1:14.
- Mar 2020
- Conference Presentation
A New Analysis of Differential Privacy's Generalization Guarantees
By: Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi and Moshe Shenfeld
We give a new proof of the "transfer theorem" underlying adaptive data analysis: that any mechanism for answering adaptively chosen statistical queries that is differentially private and sample-accurate is also accurate out-of-sample. Our new proof is elementary and... View Details
Jung, Christopher, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, and Moshe Shenfeld. "A New Analysis of Differential Privacy's Generalization Guarantees." Paper presented at the 11th Innovations in Theoretical Computer Science Conference, Seattle, March 2020.
- Article
Active World Model Learning with Progress Curiosity
By: Kuno Kim, Megumi Sano, Julian De Freitas, Nick Haber and Daniel Yamins
World models are self-supervised predictive models of how the world evolves. Humans learn world models by curiously exploring their environment, in the process acquiring compact abstractions of high bandwidth sensory inputs, the ability to plan across long temporal... View Details
Kim, Kuno, Megumi Sano, Julian De Freitas, Nick Haber, and Daniel Yamins. "Active World Model Learning with Progress Curiosity." Proceedings of the International Conference on Machine Learning (ICML) 37th (2020).