When sharing becomes a liability: An intellectual capital approach to describing the dichotomy of knowledge protection versus sharing in intra- and interorganizational relationships

The tension created when companies are collaborating with competitors – sometimes termed co-opetition - has been subject of research within the network approach. As companies are collaborating with competitors, they need to simultaneously share and protect knowledge. The opportunistic behavior and learning intent of the partner may be underestimated, and collaboration may involve significant risks of loss of competitive edge. Contrastingly, the central tenet within the Intellectual Capital approach is that knowledge grows as it flows. The person sharing does not lose the knowledge and therefore knowledge has doubled from a company’s point of view. Value is created through the interplay of knowledge flows between and within three forms of intellectual capital: human, structural and relational capital. These are the points of departure for the research conducted in this thesis. The thesis investigates the tension between collaboration and competition through an Intellectual Capital lens, by identifying the actions taken to share and protect knowledge in interorganizational collaborative relationships. More specifically, it explores the tension in knowledge flows aimed at protecting and sharing knowledge, and their effect on the value creation of a company. It is assumed, that as two companies work closely together, the collaborative relationship becomes intertwined between the two partners and the intellectual capital flows of both companies are affected. The research finds that companies commonly protect knowledge also in close and long-term collaborative relationships. The knowledge flows identified are both collaborative and protective, with the result that they sometimes are counteracting and neutralize each other. The thesis contributes to the intellectual capital approach by expanding the understanding of knowledge protection in interorganizational relationships in three ways. First, departing from the research on co-opetition it shifts the focus from the internal view of the company as a repository of intellectual capital onto the collaborative relationships between competing companies. Second, instead of the traditional collaborative and sharing point of departure, it takes a competitive and protective perspective. Third, it identifies the intellectual capital flows as assets or liabilities depending on their effect on the value creation of the company. The actions taken to protect knowledge in an interorganizational relationship may decrease the value created in the company, which would make them liabilities.

Knowledge Sharing in Multinational Corporations - A Social Captal Perspective (summary section only)

Multinational corporations (MNCs) are commonly perceived as networks of differentiated units, dependent for their competitive edge on the sharing of different kinds of internal resources. This ‘differentiated network’ view of the MNC strongly emphasizes the crucial role of interunit knowledge sharing, the topic of this thesis. The five essays presented here contribute to the research on interunit knowledge sharing in MNCs by focusing on the roles played by language, identity, and feedback seeking in the knowledge sharing process. While these factors have occasionally been brought up in previous research as potentially relevant for interunit knowledge sharing, they have so far been subject to limited empirical examination – an important omission which this thesis is an effort to redress. Furthermore, the treatment of the topic is anchored in a theoretical framework based on social capital. This perspective contributes to MNC research by providing a comprehensive framework for examining the significance of social relationships in interunit interaction. The findings can be summarized in two main points. Firstly, language skills and shared identity appear to promote the accumulation of interunit social capital. Secondly, high levels of interunit social capital seem to promote interunit knowledge sharing and feedback seeking. These observations raise a number of both theoretical and practical issues of considerable relevance for MNC management.

Determinants of Profit Sharing in the Finnish Sector

This study investigates the role of factors that determine individual employee’s and firms participation in profit sharing schemes. Using a large panel data of Finnish employees for the period 1996-2000 we analyse individual and workplace characteristics that make firms employ profit sharing schemes and workers susceptible of receiving profit sharing bonuses. In particular two links between profit sharing schemes and workers performance have been analysed. First, in looking at profit sharing as an incentive device the results show a positive link between firm size and monitoring costs. Second, we find that younger individuals with higher mean salary and capacity to bear risk are more susceptible to profit sharing schemes. The industrial sector in which the individual is employed is also an important determinant factor. We find weak evidence of a relationship between performance of firms and employment of profit sharing schemes at the industrial sector level.

Information Sharing in Banking: A Collusive Device?

We show that information sharing among banks may serve as a collusive device. An informational sharing agreement is an a-priori commitment to reduce informational asymmetries between banks in future lending. Hence, information sharing tends to increase the intensity of competition in future periods and, thus, reduces the value of informational rents in current competition. We contribute to the existing literature by emphasizing that a reduction in informational rents will also reduce the intensity of competition in the current period, thereby reducing competitive pressure in current credit markets. We provide a large class of economic environments, where a ban on information sharing would be strictly welfare-enhancing.

Factors Affecting Knowledge Sharing in Strategic Alliances: The Role of Knowledge Sharing as Strategic Control Behavior among Multinational Enterprises

International strategic alliances (ISAs) have become increasingly important for the stability, growth, and long-term viability of modern business organizations. Alliance partnerships as inter-firm cooperative ventures represent an influential mechanism for asserting corporate strategic control among autonomous multinational enterprises. These different cooperative arrangements are made of equity investments or contractually-based partnerships. Different alliance forms represent different approaches that partner firms adopt to control their mutual dependence on the alliance and on other partners. Earlier research shows that the partner characteristics could provide an explanation for alliance strategic behavior and see alliances as alternative forms to markets or hierarchies for addressing specific strategic needs linked to partners’ characteristics and their subsequent strategic motives. These characteristics of the partners’ and subsequent strategic motives are analyzed as knowledge sharing factors and how these influence inter-firm control in alliances within the context of the focal-firm STMicroelectronics and its alliance partners Nokia, Ericsson and IBM. This study underline that as contracts are incomplete, they are therefore required to maintain mutual dependence based control mechanisms in addition to a contract. For example, mutual dependence based control mechanisms could be joint financial investments and the building of an ownership structure between the parties (e.g., JVs). However, the present study clarifies that subsequent inter-firm control is also exercised through inter-firm knowledge sharing. The present study contributes by presenting a dynamic interplay between competitive and cooperative rent seeking behavior. Such coopetition behavior describes the firm's strategic orientation to achieve a dynamic balance between competitive and cooperative strategies. This balance is seen in knowledge sharing based cooperation and competition behavior. Thus this study clarifies coopetition strategies by introducing the role of inter-firm cooperation and the competitive nature of knowledge sharing. Simultaneous cooperative and competitive behavior is also seen as synergetic rent-seeking behavior. Therefore, this study extends the perspective of previous studies on competitive and cooperative seeking behavior.

Decentralized Parallel Operation of Inverters Sharing Unbalanced and Nonlinear Loads

In this paper, a wireless control strategy for parallel operation of three-phase four-wire inverters is proposed. A generalized situation is considered where the inverters are of unequal power ratings and the loads are nonlinear and unbalanced in nature. The proposed control algorithm exploits the potential of sinusoidal domain proportional+multiresonant controller ( in the inner voltage regulation loop) to make the system suitable for nonlinear and unbalanced loads with a simple and generalized structure of virtual output-impedance loop. The decentralized operation is achieved by using three-phase P/Q droop characteristics. The overall control algorithm helps to limit the harmonic contents and the degree of unbalance in the output-voltage waveform and to achieve excellent power-sharing accuracy in spite of mismatch in the inverter output impedances. Moreover, a synchronized turn on with consequent change over to the droop mode is applied for the new incoming unit in order to limit the circulating current completely. The simulation and experimental results from-1 kVA and -0.5 kVA paralleled units validate the effectiveness of the scheme.

META-NORD: Towards Sharing of Language Resources in Nordic and Baltic Countries

This paper introduces the META-NORD project which develops Nordic and Baltic part of the European open language resource infrastructure. META-NORD works on assembling, linking across languages, and making widely available the basic language resources used by developers, professionals and researchers to build specific products and applications. The goals of the project, overall approach and specific focus lines on wordnets, terminology resources and treebanks are described. Moreover, results achieved in first five months of the project, i.e. language whitepapers, metadata specification and IPR, are presented.

Edge-sharing bioctahedral diruthenium(III) complexes containing methoxy and carboxylate bridges:x-ray structures, redox behavior, and core stability

Edge-sharing bioctahedral (ESBO) complexes [Ru-2(OMe)(O2CC6H4-p-X)3(1-MeIm)(4)](ClO4)2 (X = OMe (1a), Me (1b)) and [Ru-2(O2CC6H4-P-X)(4)(1-MeIm)(4)](ClO4)(2) (X = OMe (2a), Me (2b)) are prepared by reacting Ru2Cl(O(2)CR)(4) with 1-methylimidazole (1-MeIm) in methanol followed by treatment with NaClO4. Complex 2a and the PF6- salt (1a') of 1a have been structurally characterized. Crystal data for 1a.1.5MeCN. 0.5Et(2)O: triclinic, P (1) over bar, a = 13.125(2) Angstrom, b = 15.529(3) Angstrom, c 17.314(5) Angstrom, a; 67.03(2)degrees, beta 68.05(2)degrees, gamma = 81.38(1)degrees, V 3014(1) Angstrom(3), Z = 2. Crystal data for 2a: triclinic, P (1) over bar, a 8.950(1) Angstrom, b = 12.089(3) Angstrom, c = 13.735(3) Angstrom, alpha 81.09(2)degrees, beta = 72.27(1)degrees, gamma = 83.15(2)degrees, V = 1394(1) Angstrom(3), Z = 1. The complexes consist of a diruthenium(III) unit held by two monoatomic and two three-atom bridging ligands. The 1-MeIm ligands are at the terminal sites of the [Ru-2(mu-L)(eta(1):mu-O(2)CR)(eta(1):eta(1):mu-O(2)CR)(2)](2+) core having a Ru-Ru single bond (L = OMe or eta(1)-O(2)CR). The Ru-Ru distance and the Ru-O-Ru angle in the core of 1a' and 2a are 2.49 Angstrom and similar to 76 degrees. The complexes undergo one-electron oxidation and reduction processes in MeCN-0.1 M TBAP to form mixed-valence diruthenium species with Ru-Ru bonds of orders 1.5 and 0.5, respectively.

Lazy structure sharing for query optimization

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example