Empirical research on complementarity between organizational design decisions has traditionally focused on the question of existence of complementarity. In this paper we take a broader approach to the issue, combining a “productivity” and an “adoption” approach, while including a search for contextual variables in the firm’s strategy that affect complementarity. Analysis of contextual variables...

This paper examines complementarity among vertical integration decisions in automobile product development. Though most research assumes that contracting choices are independent of each other, contracting complementarity may arise when governance choices impact the equilibrium degree of coordination among agents. First, effective coordination may depend on the level of (non-contractible) effort...

In 6 studies, the authors examined the perception of dominance complementarity, which is the perception of a target as different from the self in terms of dominance. The authors argue that these perceptions are motivated by the desire for positive task relationships. Because dominance complementarity bodes well for task-oriented relationships, seeing dominance complementarity allows one to be o...

We introduce and consider a new class of complementarity problems, which is called the absolute value complementarity problem. We establish the equivalence between the absolute complementarity problems and the fixed point problem using the projection operator. This alternative equivalent formulation is used to discuss the existence of a solution of the absolute value complementarity problem. A ...

This study focused on channel complementarity among various interpersonal communication channels (face-to-face, telephone, e-mail, text messaging, and Facebook). We looked at daily channel use among 136 participants and demonstrated complementary channel use among most combinations of channels, excluding face-to-face. We also extended channel complementarity theory by examining social competenc...

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.