Sequential Pre-Marital Investment Games: Implications for Unemployment

Agents on the same side of a two-sided matching market (such as the marriage or labor market) compete with each other by making self-enhancing investments to improve their worth in the eyes of potential partners. Because these expenditures generally occur prior to matching, this activity has come to be known in recent literature (Peters, 2007) as pre-marital investment. This paper builds on that literature by considering the case of sequential pre-marital investment, analyzing a matching game in which one side of the market invests first, followed by the other. Interpreting the first group of agents as workers and the other group as firms, the paper provides a new perspective on the incentive structure that is inherent in labor markets. It also demonstrates that a positive rate of unemployment can exist even in the absence of matching frictions. Policy implications follow, as the prevailing set of equilibria can be altered by restricting entry into the workforce, providing unemployment insurance, or subsidizing pre-marital investment.

Fast Algorithms Using Minimal Data Structures for Common Topological Relationships in Large, Irregularly-spaced Topographic Data Sets

Digital terrain models (DTM) typically contain large numbers of postings, from hundreds of thousands to billions. Many algorithms that run on DTMs require topological knowledge of the postings, such as finding nearest neighbors, finding the posting closest to a chosen location, etc. If the postings are arranged irregu- larly, topological information is costly to compute and to store. This paper offers a practical approach to organizing and searching irregularly-space data sets by presenting a collection of efficient algorithms (O(N),O(lgN)) that compute important topological relationships with only a simple supporting data structure. These relationships include finding the postings within a window, locating the posting nearest a point of interest, finding the neighborhood of postings nearest a point of interest, and ordering the neighborhood counter-clockwise. These algorithms depend only on two sorted arrays of two-element tuples, holding a planimetric coordinate and an integer identification number indicating which posting the coordinate belongs to. There is one array for each planimetric coordinate (eastings and northings). These two arrays cost minimal overhead to create and store but permit the data to remain arranged irregularly.