bluuebunny/crossref_metadata_2025 huggingface dataset:
The Weighted Euclidean 1-Center Problem
Authors: Megiddo Nimrod
Published: October 2008

We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the maximal weighted distance to a point in a set of n given points. The algorithm can be extended to higher dimensional spaces. For any fixed dimension our bound is o(n1+ϵ) for any ϵ > 0.
A Fixed Point Approach to Certain Convex Programs with Applications in Stochastic Programming
Authors: Fukushima Masao
Published: October 2008

This paper characterizes a certain convex program, which often arises in connection with stochastic programming as a fixed point problem, and explores the possibility of solving it by applying simplicial algorithms for finding fixed points of point-to-set mappings. We first establish equivalence between the convex program and the fixed point problem for some point-to-set mapping. As this mapping may have unfavorable properties from a computational viewpoint, we then modify it to reconstruct a point-to-set mapping and consider the application of a simplicial fixed point algorithm to the latter mapping. It is shown that the algorithm converges to a fixed point of the mapping and yields an optimal solution to the original convex program under certain conditions.
A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
Authors: Saigal R.
Published: October 2008

We consider here the problem of solving a system of n nonlinear equations in n variables, when n is large, but the underlying mapping has a sparse Jacobian, and is also structured. We present a homotopy, having a variable dimension feature, whose implementation in a PL algorithm effectively exploits the sparsity of the Jacobian and separability of the mapping. The implementation given here uses the Cholesky factorization and is thus stable. An application to a large system is also discussed.
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
Authors: Cho D. Chinhyung , Padberg Manfred W. , Rao M. R.
Published: October 2008

Several lifting procedures for facets of the uncapacitated plant location problem are discussed. Also, necessary and sufficient conditions for nontrivial facets with 0-1 integer coefficients are derived. In addition, all of the facets for the case of three or more plants and three destinations are identified.
Optimal Consumption and Investment Policies Allowing Consumption Constraints and Bankruptcy
Authors: Lehoczky J. , Sethi S. , Shreve S.
Published: October 2008

An agent can distribute his wealth between two investments, one with a fixed rate of return r and the other with a random rate of return (modeled as a diffusion) with mean r. The agent seeks to maximize total discounted utility from consumption over an infinite horizon. Consumption may be constrained from below. Various models for bankruptcy, including welfare, are considered. The agent has a strictly concave utility function for consumption; however, it is shown that the utility function for wealth may have convex portions, thus the agent may be risk seeking. The paper gives a complete treatment of the existence and nonexistence of optimal policies. New theorems for the optimal control of degenerate diffusions are given, as well as explicit formulas for the value function.
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
Authors: Balas Egon
Published: October 2008

The ratio between the values of optimal integer and fractional solutions to a set covering problem was shown by Johnson (Johnson, D. S. Approximation algorithms for combinatorial problems. J. Comput. System. Sci. 9 256–278.) and Lovász (Lovász, L. On the ratio of optimal integral and fractional covers. Discrete Math. 13 383–390.) to be bounded by B(d) = 1 + ln d, where d is the largest column sum. We show that if n is the number of variables, [Formula: see text] is a best possible bound on this ratio. Furthermore, for every n > 20 there is a class of problems with O(2n) constraints, for which B(n) < (2/5)B(d). We also exhibit a heuristic that is guaranteed to find an integer solution such that the ratio of its value to that of an optimal fractional solution is bounded by B(n).
Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling
Authors: Loulou Richard
Published: October 2008

We study the partitioning problem, consisting in partitioning a sublist of n positive numbers into m disjoint sublists such that the maximum sublist is minimized. This is equivalent to minimizing the completion time of n jobs on m parallel identical processors. We establish upper bounds on the deviation from optimality of two heuristics: the well-known LPT heuristic, and the on-line RLP heuristic. These bounds serve to establish a probabilistic analysis of these heuristics; for both of them, the absolute deviation from optimality remains finite, when the size of the list of numbers becomes infinite. This is a stronger result than previous convergence theorems, and it is valid whenever the processing times are iid random variables with finite mean and arbitrary distributions.
Life Lengths and Association: A Dynamic Approach
Authors: Arjas Elja , Norros Ilkka
Published: October 2008

We give two sets of conditions for the association of a system's component life lengths. The conditions are dynamic in the sense that they are based on evaluating, at any given time t, the effect a failure would have on the system's future behaviour. Of basic importance is the concept “weakened by failures” introduced in the paper. Mathematically the paper is based on martingales in the case of jump processes, or marked point processes.
Diagonality of Cost Allocation Prices
Authors: Mirman Leonard J. , Neyman Abraham
Published: October 2008

The problem of allocating the production cost of a finite bundle of divisible consumption goods (or services) by means of per unit costs or prices is a basic problem in economics. Recently an axiomatic approach has been proposed (Billera and Heath [Billera, L. J., D. C. Heath. 1981. Allocation of shared costs: a set of Axioms yielding a unique procedure. Math. Oper. Res. 7 32–39.] and Mirman and Tauman [Mirman, L. J., Y. Tauman. 1981. Demand compatible equitable cost sharing prices. Math. Oper. Res. 7 40–56.]) in which one considers a class of cost problems and studies the mappings from that class of cost problems to prices by means of the properties these prices satisfy. We look for a list of properties on the class of cost problems and the price mechanism that imply the “diagonality” of the price mechanism.
Necessary Conditions in Nonsmooth Optimization
Authors: Ioffe A. D.
Published: October 2008

The paper contains four theorems concerning first order necessary conditions for a minimum in nonsmooth optimization problems in Banach spaces: a Lagrange multiplier rule for a mathematical programming problem in which an infinite dimensional equality constraint is included in the constraints, a general maximum principle for nonsmooth optimal control problems with state constraints, and a kind of multiplier rule for mathematical programming problems which applies when only finitely many equality constraints are present but when the Lipschitz continuity assumptions are removed. A summary of relevant background results from analysis is provided.
Minimum Convex Cost Dynamic Network Flows
Authors: Orlin James B.
Published: October 2008

This paper presents and solves in polynomial time the minimum convex cost dynamic network flow problem, an infinite horizon integer programming problem which involves network flows evolving over time. The model is a finite network in which each arc has an associated transit time for flow to pass through it. An integral amount of flow is to be sent through arcs of the network in each period over an infinite horizon so as to satisfy conservation of flow from some fixed period on. Furthermore, the net amount of flow “in transit” is assumed fixed over the infinite horizon. The objective is to minimize the average convex cost per period of sending flow.

This problem is a generalization of the minimum convex cost network flow problem, the maximum throughput dynamic network flow problem, and the minimum cost-to-time ratio circuit problem. Furthermore, the model has applications in periodic production and transshipment, airplane scheduling, cyclic capacity scheduling, and cyclic staffing.

To solve the dynamic network flow problem, one first obtains an optimal continuous-valued flow which repeats every period. The fractional variables of this solution may be rounded in such a way as to obtain an optimal integral flow which repeats every q periods, where q is the least common denominator of the fractional parts of the continuous flow. Furthermore, this integral flow is also an optimal continuous flow.
Duality and an Algorithm for a Class of Continuous Transportation Problems
Authors: Anderson E. J. , Philpott A. B.
Published: October 2008

In this paper we treat the problem of transferring mass at least cost from one line segment to another, when there is a continuous cost function c(x, y) giving the cost of transferring material from the point x on the first line segment to the point y on the second. The mass has to be arranged with uniform density on the second line segment after the transfer. This is a one-dimensional form of the well-known mass-transfer problem. It is an infinite-dimensional linear program. We discuss duality theory for this problem and give an algorithm which converges to an optimal solution.
A Finite Method for the Solution of a Multi-Resource Allocation Problem with Concave Return Functions
Authors: Einbu John M.
Published: October 2008

It has recently been recognized that the problem of allocating continuous resources to several activities, each with a concave return function, has some elements in common with the Transportation Problem. This has inspired a search for solution algorithms for the allocation problem in which the approach used is similar to that applied to the Transportation Problem. This paper describes such an algorithm. The algorithm terminates and produces the exact optimal solution. A FORTRAN implementation of the algorithm solves a 12 resources/100 activities problem in less than 10 central processor seconds on a Cyber 173 computer.
A Unifying Note on Fatou's Lemma in Several Dimensions
Authors: Balder E. J.
Published: October 2008

A general version of Fatou's lemma in several dimensions is presented. It subsumes the Fatou lemmas given by Schmeidler (Schmeidler, D. 1970. Fatou's lemma in several dimensions. Proc. Amer. Math. Soc. 24 300–306.), Hildenbrand (Hildenbrand, W. 1974. Core and equilibria of a large economy. Princeton University Press, Princeton.), Cesari-Suryanarayana (Cesari, L., M. B. Suryanarayana. 1978. An existence theorem for pareto problems. Nonlinear Anal. 2 225–233.), and Artstein (Artstein, Z. 1979. A note on Fatou’s lemma in several dimensions. J. Math. Econom. 6 277–282.). Also, it is equivalent to an abstract variational existence result that extends and generalizes results by Aumann-Perles (Aumann, R. J., M. Perles. 1965. A variational problem arising in economics. J. Math. Anal. Appl. 11 488–503.), Berliocchi-Lasry (Berliocchi, H., J.-M. Lasry. 1973. Integrands normales et mesures paramétrées en calcul des variations. Bull. Soc. Math. France 101 129–184.), Artstein (Artstein, Z. 1974. On a variational problem. J. Math. Anal. Appl. 45 404–415.), and Balder (Balder, E. J. 1979. On a useful compactification for optimal control problems. J. Math. Anal. Appl. 72 391–398.) in several respects.
Dichotomous Search for Random Objects on an Interval
Authors: Hassin R. , Henig M.
Published: October 2008

A set of objects to be searched is represented by a set of points lying in an interval of integers. We wish to identify these points within unit-intervals through a dichotomous search, minimizing the expected cost of the search.

The optimal search strategy may depend on the information gained at each stage of the search. It is shown here that for some cases there exists a common optimal strategy. This strategy is generally different from the bisection procedure, and is independent of the number of objects in the interval. As a matter of fact, at each stage of the search a partition of the interval is given and the only information needed for searching a subinterval of this partition is that it still contains an unidentified point.
Axioms and Examples Related to Ordinal Dynamic Programming
Authors: Blair Charles E.
Published: October 2008

This note is intended as a continuation of Sobel's work on ordinal dynamic programming (Sobel, M. J. 1975. Ordinal dynamic programming. Management Sci. 21 967–975.). We generalize several results of that paper. Also, some examples are given to clarify differences between the treatment of ordinal dynamic programming in (Sobel, M. J. 1975. Ordinal dynamic programming. Management Sci. 21 967–975.) and Sobel's later treatment (Sobel, M. J. 1980. Ordinal sequential games. Econom. et Societies XIV 1571–1581.).
Convergence Rates for the Optimal Values of Allocation Processes
Authors: Artstein Zvi
Published: October 2008

The optimal allocation process is of the following type. A sequence of functions (production functions) f1, f2, …, is given, each mapping R+n into [0, ∞). Along with it a vector q > 0 in R+n (vector of resources) is provided. For each integer k we consider the problem [Formula: see text] Here R+n is the nonnegative orthant of the n-dimensional Euclidean space. Inequalities between vectors are taken coordinatewise.

In this paper we consider the case where the functions fi are subject to randomness. Specifically, they are generated as independent random drawings from a common distribution. In particular fi = fi(x, ω) with ω being in a probability space, and the solutions xi might depend on u, as well as on k and q. The detailed technical conditions are displayed in §2. We are interested in limit properties, as k → ∞, of the optimal values of the allocation process.
Approximation Algorithms for the Assembly Line Crew Scheduling Problem
Authors: Hsu Wen-Lian
Published: October 2008

Given an m × n nonnegative matrix, we study the problem of independently permuting the elements in each column so as to minimize the maximum row sum. This problem is NP-hard even when we restrict it to the m × 3 case. A special case of our problem is the multiprocessor scheduling problem without precedence constraints. In this paper we give a (2 − 1/m)-algorithm for the general m × n case. We also design a 3/2-algorithm for the m × 3 case, which applies a restricted longest-processing-time-first heuristic. Finally, using an edge matching algorithm, we produce a more elaborate algorithm that guarantees a bound of 4/3 for the m × 3 case.
Storage Processes with Markov Additive Input and Output
Authors: Kaspi Haya
Published: October 2008

We consider a storage process to which both input and output are Markov additive processes defined on the same driving Markov process X. We study the process (X, W) where W is the content of the system.

This paper has two main parts. The first uses excursion theory of Markov processes to study ladder processes of Markov additive processes (not necessarily arising from storage processes). This analysis enables us to find conditions for the existence of a limiting distribution for the Markov process (X, W). The second part uses a representation of the invariant measure for (X, W) to study the problem of level crossings of the content process W.
Diffusion Approximations for Storage Processes with General Release Rules
Authors: Yamada Keigo
Published: October 2008

For a sequence of storage processes with general release rate functions which contain, as a special case, queueing processes, we show that under appropriate conditions suitably normalized storage processes converge to a Bessel process with negative drift in the sense of law.
Vector Measures Are Open Maps
Authors: Samet Dov
Published: October 2008

Nonatomic vector measures are shown to be open maps from the σ-field on which they are defined to their range, where the σ-field is equipped with the pseudometric of the symmetric difference with respect to a given scalar measure.
Stochastic Dominance and Moment Inequalities
Authors: O'Brien G. L.
Published: October 2008

For any distribution function (df) F, define F1 = F and Fn+1 (x) = ∫−∞x Fn(y) dy. For two df's F and G, we obtain a relationship between the behaviour of Gn(x) − Fn(x) for large x and certain inequalities involving the moments of F and G. In particular, we generalize Fishburn's theorem, which deduces such inequalities from the condition that Gn(x) − Fn(x) ≥ 0 for all x.
The Laguerre Transform and a Family of Functions with Nonnegative Laguerre Coefficients
Authors: Sumita Ushio
Published: October 2008

The Laguerre transform induced in Keilson and Nunn (Keilson, J., W. R. Nunn. 1979. Laguerre transformation as a tool for the numerical solution of integral equations of convolution type. Appl. Math. Comp. 5 313–359.) and Keilson, Nunn and Sumita (Keilson, J., W. R. Nunn, U. Sumita. 1981. The bilateral Laguerre transform. Appl. Math. Comp. 8 137–174.) maps functions in L2 into discrete sequences and permits rapid numerical calculation of basic continuum operations such as differentiation, integration and convolution. In this paper we study a family of functions 𝒫 with nonnegative Fourier–Laguerre coefficients. A uniform bound for truncation error can be easily found for this family. It will be shown that the family 𝒫 is closed under positive scalar multiplication, convex mixing, and multiplication by completely monotone functions.
Thinning of Cluster Processes: Convergence of Sums of Thinned Point Processes
Authors: Serfozo Richard
Published: October 2008

This is a study of the convergence in distribution of sums of dependent point processes that are becoming uniformly sparse due to a thinning operation. Under this operation, each point process is randomly deleted or retained depending on its structure, and when a process is retained, each of its points is deleted or retained depending on its location and the structure of the process. Such a sum can be interpreted as a thinned cluster process: the residual of a cluster process after its cluster origins and single points have been thinned. Our main result gives a necessary and sufficient condition for the sums to converge and states that their limit must be a Cox process (a Poisson process with a random intensity measure). This result has some parallels to the classical result on the convergence of sums of independent point processes to a Poisson process, and it contains Kallenberg's result on the convergence of a thinned point process to a Cox process. Corollaries are presented for the cases in which the processes being summed are either independent or satisfy a weak law of large numbers before they are thinned. In addition, sufficient conditions are given for sums of randomly selected processes, with no single point deletions, to converge to infinitely divisible point processes or to mixtures of these processes.
Departures from a Queue with Many Busy Servers
Authors: Whitt Ward
Published: October 2008

To analyze networks of queues, it is important to be able to analyze departure processes from single queues. For the M/M/s and M/G/∞ models, the stationary departure process is simple (Poisson), but in general the stationary departure process is quite complicated. As a basis for approximations, this paper shows that the stationary departure process is approximately Poisson when there are many busy slow servers in a large class of stationary G/GI/s congestion models having s servers, infinite waiting room, the first-come first-served discipline, and mutually independent and identically distributed service times that are independent of a stationary arrival process. Limit theorems are proved for the departure process in a G/GI/s system in which the number of servers and the offered load (arrival rate divided by the service rate) both increase. The asymptotic behavior of the departure process depends on the way the arrival rate changes. If the arrival rate is held fixed, so that the offered load increases by slowing down the service rate, then the departure process converges to a Poisson process. For this result, the service-time distribution is assumed to be phase-type. Other limiting behavior occurs if the arrival rate approaches zero or infinity. Convergence is established in each case by applying previous heavy-traffic limit theorems.
Iterative Optimization with Equality Constraints
Authors: Warga J.
Published: October 2008

We discuss certain globally convergent iterative procedures for determining an “extremal” of a nonconvex optimization problem with a finite number of equality constraints and infinite-dimensional inclusion constraints. These procedures are designed for nonlinear programming and for relaxed optimal control problems with isoperimetric and unilateral restrictions. We also present a variant of one such procedure which does not involve any infinite subiterations.
Life Distribution Properties of Devices Subject to a Lévy Wear Process
Authors: Abdel-Hameed Mohamed
Published: October 2008

Assume that a device is subject to wear. Over time the wear is assumed to be an increasing Lévy process (Xt). Suppose the device has a threshold Y with right-tail probability Ḡ. Let ζ be the failure time of the device and F̄x be its survival probability given that X0 = x. It is shown that life distribution properties of Ḡ are inherited as corresponding properties of F̄x for each x ∈ R+. Optimal replacement policies for such devices are discussed for suitably chosen cost functions when Ḡ is absolutely continuous on R+ with a bounded failure rate.
Optimal Repair Allocation in a Series System
Authors: Katehakis Michael N. , Derman Cyrus
Published: October 2008

In this paper we consider a problem on the optimal assignment over time of a single repairman to failed components in a series system. The following assumptions are made. The component failure and repair times are random variables with exponential distributions, independent of the state of other components. Component failures can occur even while the system is not functioning and it is permissible to reassign the repairman among failed components without penalty. It is shown that the policy which always assigns the repairman to the failed component with the smallest failure rate, among the failed ones, maximizes the availability of the system, irrespective of the values of the repair rates.
Stock Positioning and Performance Estimation in Serial Production-Transportation Systems
Authors: Gallego Guillermo , Zipkin Paul
Published: October 2008

This paper considers serial production-transportation systems. In recent years, researchers have developed a fairly simple functional equation that characterizes optimal system behavior, under the assumption of constant leadtimes. We show that the equation covers a variety of stochastic-leadtime systems as well. Still, many basic managerial issues remain obscure: When should stock be held at upstream stages? Which system attributes drive overall performance, and how? To address these questions, we develop and analyze several heuristic methods, inspired by observation of common practice and numerical experiments. One of these heuristics yields a bound on the optimal average cost. We also study a set of numerical examples, to gain insight into the nature of the optimal solution and to evaluate the heuristics.
Manufacturing & Service Operations Management: An Introduction
Authors: Schwarz Leroy B.
Published: October 2008

The publication of Volume 1, Number 1 of M&SOM marks the end of a process that began more than three years ago: a process whose goal was to create the premier journal in operations management. I will leave it to you, the reader of 1:1, to decide whether or not we have been successful “right out of the blocks” or if more issues must be published before we can rightfully claim to have succeeded. But we will suceed. I am committed to it. So are the distinguished group of senior editors and the esteemed members of M&SOM's Editorial Review Board, whose names are, and will remain, prominently featured in every issue. And most important, so are the authors who have submitted their manuscripts to us.
At the Crossroads: A Multiple-Level Explanation of Individual Attainment
Authors: Lawrence Barbara S.
Published: October 2008

Individual attainment within organizational careers, or career mobility, has been explained by individual attributes and by demographic processes. These seemingly unrelated views can be reconciled by suggesting that employees develop a shared perception of their organizations's career hierarchy, and that this shared perception produces systematic managerial selection preferences that influence individual attainment. A study that examines the first part of this process is presented. The results, based on questionnaire data from an electric utility, suggest that managers do develop a shared perception of their organization's career hierarchy. However, managers' perceptions are not unanimous, and the analysis examines two explanations for perceptual variation. The implications of the proposed connection for further development of a multiple-level explanation of individual attainment are discussed.
Some Characteristics of One Type of High Reliability Organization
Authors: Roberts Karlene H.
Published: October 2008

This paper is concerned with defining organizational processes necessary to operate safely technologically complex organizations that can do great physical harm to themselves and their surrounding environments. The paper first argues that existing organizational research is little help in understanding organizational processes in such organizations. It then identifies nuclear powered aircraft carriers as examples of potentially hazardous organizations with histories of excellent operations. The paper then examines a set of components of “risk” identified by Perrow (1984) and antecedents to catastrophe elucidated by Shrivastava (1986) and discusses how carriers deal with these factors to lessen their potentially negative effects. The paper concludes with suggestions for future research.
The Double-Edge of Organizational Legitimation
Authors: Ashforth Blake E. , Gibbs Barrie W.
Published: October 2008

Organizations require legitimacy to attract constituents' support Legitimacy, however, is always problematic. Thus, organizations frequently pursue legitimacy through a variety of substantive and symbolic practices. But legitimacy is a social judgment that is ultimately accorded the organization by its constituents. Organizations that pursue this judgement run the risk of “protesting too much”–of being perceived as precisely the opposite, manipulative and illegitimate. Such organizations include (1) the clumsy actor, perceived as unethical, heavy-handed, or insensitive, (2) the nervous actor, perceived as dogmatic, intolerant, or evasive, and (3) the overacting actor, perceived to overstate claims to legitimacy or overreact to faults. The analysis suggests that attempts to increase legitimacy may trigger a series of vicious circles which ultimately decrease legitimacy.
Structural Evolution Through Idiosyncratic Jobs: The Potential for Unplanned Learning
Authors: Miner Anne S.
Published: October 2008

This paper describes an evolutionary model of organizational change through the selective retention of jobs. This type of change can operate in addition to top-down planned organizational change, providing “another engine” of organizational transformation over time.

All evolutionary change processes require that there be a system for replicating activities over time, a source of variation in activities, and mechanisms which permit some activities to persist while others do not. In this model, formalized job systems and related management practices provide the mechanism for the replication of job activities. Idiosyncratic jobs—or jobs created around particular people rather than in the abstract—serve as a mechanism for unplanned variation in sets of job duties. Finally managerial actions such as layoffs, reorganizations, budget changes and copying jobs from other areas lead to the selective retention of some sets of job activities over others.

The organizational change created by these processes may or may not be adaptive for the organization. The outcome will depend on such factors as the birth, death and imitation rates for idiosyncratic and other jobs, as well as the criteria used for job birth and job termination. Adaptation is possible, but is a function of complex, nonlinear constraints. Specific organizational processes that determine these factors are discussed.

The model implies that adaptive change can occur in the absence of clear and consistent goals. Thus, the model's implications contradict the frequent assumption of strategic planning literatures that clear and stable goals are necessary for adaptive organizational change. Formalization is necessary for the organization to maintain over time those job activities which have proved to be useful innovations. Thus, the model's implications also contradict the assumption in structural contingency theory that formalization deters adaptive change.

Although consistent with other theories of evolutionary organizational change, the model extends prior work by detailing concrete mechanisms, clarifying boundary conditions for the process, and stressing that adaptation is feasible but definitely not assured. The outcome depends in part upon managerial attention to organizational processes rather than to outcomes, and “benign opportunism”—or creative attention to unfolding organizational competencies.

Finally, the paper outlines the potential of the model for further study, especially for empirical research on evolutionary change processes and on organizational learning. The evolutionary change process described can be seen as a form of trial-and-error learning in which retained jobs constitute the organization's memory. It is distinct from many other organizational learning models, however, because the source of innovation—idiosyncratic jobs—is not planned in advance by top management, and may be unrelated to current aspirations of the dominant coalition.
Studying Changes in Organizational Design and Effectiveness: Retrospective Event Histories and Periodic Assessments
Authors: Glick William H. , Huber George P. , Miller C. Chet , Doty D. Harold , Sutcliffe Kathleen M.
Published: October 2008

This paper describes assumptions, rationale, and track-offs involved in designing the research methodology used in a longitudinal study of the relationships among changes in organizational contexts, designs, and effectiveness. The basic research question concerns when how, and why do different types of organizational change occur. Given this research question and a desire to develop and test generalizable theory about changes in organizational design and effectiveness, we conducted a longitudinal study of over 100 organizations. Data concerning the changes were obtained through four interviews spaced six months apart with the top manager in each organization. Each interview provided a short-term retrospective event history over the preceding 6-month interval in aggregate, the four interviews provided a 24-month event history for each organization. Additionally, periodic assessments of the state of the organization's context, design, and effectiveness were collected with two questionnaires spaced one year apart. Finally, in each organization, the top manager's personal characteristics were assessed after all other data were obtained. This paper examines the alternatives, advantages, and disadvantages of the research design decisions. With some hindsight, we also offer some suggestions for future researchers with similar goals of developing and testing generalizable explanations of change processes in organizations.
Deconstructing Organizational Taboos: The Suppression of Gender Conflict in Organizations
Authors: Martin Joanne
Published: October 2008

This paper begins with a story told by a corporation president to illustrate what his organization was doing to “help” women employees balance the demands of work and home. The paper deconstructs and reconstructs this story text from a feminist perspective, examining what it says, what it does not say, and what it might have said. This analysis reveals how organizational efforts to “help women” have suppressed gender conflict and reified false dichotomies between public and private realms of endeavor, suggesting why it has proven so difficult to eradicate gender discrimination in organizations. Implications of a feminist perspective for organizational theory are discussed.
Decision Rule Theory and Its Use in the Analysis of the Organization's Performance
Authors: Baligh Helmy H.
Published: October 2008

The specific nature of decision rules and the pattern of connections they create between people help determine the performance of an organization. To show these causal connections, decision rules are rigorously defined and their algebraic structure explored. Properties of decision rules and of structure performance are then operationally defined. A number of propositions connecting decision rule properties to performance properties are made, their meanings investigated, and their truths supported by logical arguments. The relations of these newly defined properties to others in the literature are explored and used to restate and integrate together some of the literature's vague and isolated generalizations.
Integrating Strategic, Organizational, and Human Resource Perspectives on Mergers and Acquisitions: A Case Survey of Synergy Realization
Authors: Larsson Rikard , Finkelstein Sydney
Published: October 2008

Mergers and acquisitions are complex events in organizational life for which we have incomplete understanding, in part because researchers have tended to consider only partial explanations of them. The authors addressed that problem by developing a conceptual framework that integrates theoretical perspectives from economics, finance, and especially strategy, organization theory, and human resource management to offer a broader process-oriented integrative model. The integrative model explicitly describes how synergy realization is a function of the similarity and complementarity of the two merging businesses (combination potential), the extent of interaction and coordination during the organizational integration process, and the lack of employee resistance to the combined entity. The approach differs from traditional methods of studying mergers and acquisitions in three ways: (1) the success of a merger or acquisition is gauged by the degree of synergy realization rather than more removed and potentially ambiguous criteria such as accounting or market returns; (2) the key attribute of combination potential is conceptualized not only in terms of the similarities present across businesses, as in most studies of mergers and acquisitions, but also in terms of the production and marketing complementarities between the two businesses; and (3) the data are derived from a case survey method that combines the richness of in-depth case studies with the breadth and generalizability of large-sample empirical investigations.

The framework was tested empirically across a sample of 61 mergers and acquisitions. The extent to which a merger or acquisition resulted in synergistic benefits was related to the strategic potential of the combination, the degree of organizational integration after the deal was completed, and the lack of employee resistance to the integration of the joining firms. Furthermore, the analysis revealed that (1) independent of any similarities across joining firms, the presence of complementary operations increased the probability of acquisition success by boosting synergy realization, (2) organizational integration was the single most important factor in explaining synergy realization, even to the extent that M&As with high combination potential were significantly more successful when coupled with high organizational integration than when integration efforts were less forceful, and (3) mergers and acquisitions that were dependent on gains from combining similar production and marketing operations tended to elicit more resistance from employees than M&As focused on realizing complementary benefits. Overall, the findings provide strong support for an integrative theory of mergers and acquisitions.
A Conceptual Framework for Analyzing Why Organizations Downsize
Authors: Budros Art
Published: October 2008

Although downsizing has become an integral part of organizational life in the U.S., there is little serious theoretical or empirical work on this issue. Nearly all of the completed work addresses the effects of downsizing, which usually are negative. Therefore, an important yet unanswered question is: Why do organizations downsize in the first place? In addressing this question, I offer some systematic thoughts on the causes of downsizing. Specifically, I develop a conceptual framework for studying organizational innovation that draws on two overlooked dimensions associated with this phenomenon, the basis of social action (rational versus arational) and social context (organizational versus extraorganizational). I then characterize downsizing as an organizational innovation and develop propositions that explain why organizations downsize. Finally, I emphasize that empirical evaluation of these propositions will help us to understand a pivotal organizational development of recent decades.
When Competitive Advantage Doesn't Lead to Performance: The Resource-Based View and Stakeholder Bargaining Power
Authors: Coff Russell W.
Published: October 2008

What if rent from a competitive advantage is appropriated so it cannot be observed in performance measures? The resource-based view was not formulated to examine who will get the rent. Yet, this essay argues that the factors leading to a resource-based advantage also predict who will appropriate rent. Knowledge-based assets are promising because firm-specificity, social complexity, and causal ambiguity make them hard to imitate. However, the roles of internal stakeholders may grant them a great deal of bargaining power especially relative to investors.

This essay integrates the resource-based view with the bargaining power literature by defining the firm as a nexus of contracts. This new lens can help to explain when rent will be generated and, simultaneously, who will appropriate it. In doing so, it provides a more robust theory of firm performance than the resource-based view alone. It is also suggested that this lens might be useful for examining other theories of firm performance.
Knowledge Search in International Cooperative Ventures
Authors: Shenkar Oded , Li Jiatao
Published: October 2008

By taking a learning approach to international cooperative ventures, this study introduces absorptive capacity as a principle governing the relationship between knowledge possession and knowledge search among prospective partners. Two alternative hypotheses are juxtaposed: The first is that firms will seek additional knowledge in the same area in which they already have a knowledge base; the second is that firms will seek knowledge in a complementary area. Data from 90 partner-seeking firms in China show that the possession of complementary knowledge is a prerequisite for knowledge search. Furthermore, in line with the learning perspective, the equity joint venture is the vehicle of choice for firms seeking transfer of tacit, embedded knowledge.
How Buyers Cope with Uncertainty when Acquiring Firms in Knowledge-Intensive Industries: Caveat Emptor
Authors: Coff Russell W.
Published: October 2008

Knowledge is frequently the focus of corporate acquisitions. It often cannot be acquired in efficient factor markets due to asymmetric information and because it may be bundled in teams or networks. However, variations in quality are harder to observe for knowledge-based assets than for tangible assets. This creates information dilemmas for buyers and, accordingly, a risk of overbidding, whenever a target is in a knowledge-intensive industry.

This study found that most buyers took steps to mitigate the information dilemmas associated with knowledge-based assets. Specifically, buyers coped by (1) offering lower bid premia; (2) using contingent payment (e.g., stock or earnouts); and (3) increasing information both through lengthy negotiations and by avoiding tender offers.

However, when the two firms drew on unrelated forms of expertise, buyers did not apply these strategies. It may be that a buyer's information needs are lower if little postacquisition integration is anticipated. An alternative explanation is that unrelated buyers may not be fully aware of the information dilemmas that they face. If so, they may be especially at risk of overbidding.

The contingency relationship identified here with respect to related expertise warrants further study. Both the resource-based and diversification literatures presume that relatedness is universally important. This study suggests that it may be particularly relevant when there are knowledge-based assets.
The Impact of Information Technology on Coordination: Evidence from the B-2 “Stealth” Bomber
Authors: Argyres Nicholas S.
Published: October 2008

This paper explores the economic processes through which information technology can facilitate coordination within and between firms. The paper presents and analyzes a case study of the B-2 “Stealth” bomber, an aircraft that was designed by four firms almost entirely by computer. The key information systems used in the project were (1) a common-access database to manage part designs and (2) an advanced system to perform structural analysis. These systems played a crucial role in enabling the four firms to coordinate their design and development activities precisely enough to meet the demanding engineering requirements imposed by the aircraft's unique mission. The paper analyses the case study using transaction cost, agency, and information processing theories.

The analysis leads to several conclusions about the mechanisms through which the variables emphasized in these theories operated to improve coordination. First, the information systems aided coordination directly by making information processing less costly. Second, this enhanced information processing made the governance of the project more efficient. In particular, by establishing a “technical grammar” for communication, the systems helped to create social conventions around which firms could coordinate their activities, thus limiting the need for a hierarchical authority to promote coordination. This technical grammar also reduced governance costs by reducing asset-specificity, thereby reducing risks associated with contractual holdup. These interactions between communication and governance effects have not been elucidated in the IT/coordination literature. They are important in part because they help explain why the vertically disintegrated organization of the project proved viable. Finally, the systems facilitated decentralized decision-making by reducing agency (measurement) costs. This combination of effects may generalize to other settings in which information technology is used to promote coordination, especially in “virtual” or “disaggregated” corporations.
The Effects of Mood on Individuals' Use of Structured Decision Protocols
Authors: Elsbach Kimberly D. , Barr Pamela S.
Published: October 2008

This paper begins to answer the call to broaden current theories of individual decision-making by including in them the effects of human mood. Grounding our arguments in psychological literature on the effects of mood on information processing, motivation, and decision heuristics, we develop hypotheses about how mood can significantly affect individuals' use of structured decision protocols. In support of our hypotheses, results from an experimental study of complex decision-making suggest that, in situations where a structured decision protocol is the usual method of decision-making, individuals in moderately negative moods are significantly more likely than those in moderately positive moods to: (1) carefully execute all the steps of a structured decision protocol, (2) execute the steps of a structured decision protocol in the correct order, and (3) rely on the outcome of the structured decision protocol as the primary basis for the decision. We discuss these findings in terms of their implications for both organizational decision models and psychological models of mood and decision-making. In general, our findings help establish mood as an important variable in models of organizational decision-making and help shed light on often conflicting findings about the benefits of positive vs. negative mood for individual decision-making.
Application of Complexity Theory to Organization Science
Authors: Lewin Arie Y.
Published: October 2008

This special issue originated with the 1996 Organization Science Winter Conference (OSWC), which set out to explore the implications of the science of complexity for the field of organization studies. Following the OSWC, a formal program organized by the Organization Science section of INFORMS took place in Atlanta. The vast potential for complexity theory to inform and transform research in organization studies became evident from the discussions of 22 papers that were presented at that meeting. In response to the call for papers issued after the Atlanta meeting, 56 papers were submitted to Organization Science, of which seven make up this issue.

Interest in complexity has grown dramatically since the 1996 OSWC first explored this idea. The purpose of this special issue is not to declare that a new era in organization studies and strategic management is at hand, but to explore the boundaries and links between the science of complexity—with its origin in evolution and biology—and the field of strategy and organization. The issue explores the implications of complexity research for organization studies in the context of new ways of modeling dynamic, nonlinear complex systems for advancing theoretical and empirical research in organization studies (e.g., theorizing within coevolutionary frameworks, decomposition of nested phenomena, multidirectional causalities).