Harold W. Kuhn

Bio: Harold W. Kuhn is an academic researcher from Princeton University. The author has contributed to research in topics: Linear programming & Game theory. The author has an hindex of 20, co-authored 27 publications receiving 17551 citations.

The Hungarian method for the assignment problem

Abstract: This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to tell the story of its origin.

The Hungarian Method for the Assignment Problem.

Abstract: This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to tell the story of its origin.

Contributions to the theory of games

Abstract: The description for this book, Contributions to the Theory of Games (AM-40), Volume IV, will be forthcoming.

Linear Inequalities and Related Systems.

Abstract: The description for this book, Linear Inequalities and Related Systems. (AM-38), will be forthcoming.

A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting

Abstract: In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst-case on-line framework. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multiplicative weight-update Littlestone?Warmuth rule can be adapted to this model, yielding bounds that are slightly weaker in some cases, but applicable to a considerably more general class of learning problems. We show how the resulting learning algorithm can be applied to a variety of problems, including gambling, multiple-outcome prediction, repeated games, and prediction of points in Rn. In the second part of the paper we apply the multiplicative weight-update technique to derive a new boosting algorithm. This boosting algorithm does not require any prior knowledge about the performance of the weak learning algorithm. We also study generalizations of the new boosting algorithm to the problem of learning functions whose range, rather than being binary, is an arbitrary finite set or a bounded segment of the real line.

Object tracking: A survey

Abstract: The goal of this article is to review the state-of-the-art tracking methods, classify them into different categories, and identify new trends. Object tracking, in general, is a challenging problem. Difficulties in tracking objects can arise due to abrupt object motion, changing appearance patterns of both the object and the scene, nonrigid object structures, object-to-object and object-to-scene occlusions, and camera motion. Tracking is usually performed in the context of higher-level applications that require the location and/or shape of the object in every frame. Typically, assumptions are made to constrain the tracking problem in the context of a particular application. In this survey, we categorize the tracking methods on the basis of the object and motion representations used, provide detailed descriptions of representative methods in each category, and examine their pros and cons. Moreover, we discuss the important issues related to tracking including the use of appropriate image features, selection of motion models, and detection of objects.

Property Rights and the Nature of the Firm

Abstract: This paper provides a framework for addressing the question of when transactions should be carried out within a firm and when through the market. Following Grossman and Hart, we identify a firm with the assets that its owners control. We argue that the crucial difference for party 1 between owning a firm (integration) and contracting for a service from another party 2 who owns this firm (nonintegration) is that, under integration, party 1 can selectively fire the workers of the firm (including party 2), whereas under nonintegration he can "fire" (i.e., stop dealing with) only the entire firm: the combination of party 2, the workers, and the firm's assets. We use this idea to study how changes in ownership affect the incentives of employees as well as those of owner-managers. Our framework is broad enough to encompass more general control structures than simple ownership: for example, partnerships and worker and consumer cooperatives all emerge as special cases.

Approximation Algorithms

Abstract: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

End-to-End Object Detection with Transformers

Abstract: We present a new method that views object detection as a direct set prediction problem. Our approach streamlines the detection pipeline, effectively removing the need for many hand-designed components like a non-maximum suppression procedure or anchor generation that explicitly encode our prior knowledge about the task. The main ingredients of the new framework, called DEtection TRansformer or DETR, are a set-based global loss that forces unique predictions via bipartite matching, and a transformer encoder-decoder architecture. Given a fixed small set of learned object queries, DETR reasons about the relations of the objects and the global image context to directly output the final set of predictions in parallel. The new model is conceptually simple and does not require a specialized library, unlike many other modern detectors. DETR demonstrates accuracy and run-time performance on par with the well-established and highly-optimized Faster RCNN baseline on the challenging COCO object detection dataset. Moreover, DETR can be easily generalized to produce panoptic segmentation in a unified manner. We show that it significantly outperforms competitive baselines. Training code and pretrained models are available at this https URL.