Marital status and generalized trust in other people: A population-based study

The association between marital status and generalized trust in other people was investigated. The public health survey in Skåne 2008 is a cross-sectional study including 28,198 persons (55% participation rate) aged 18–80 in southern Sweden. Logistic regression models investigated associations between marital status and trust, adjusting for age, country of birth, education, emotional support, instrumental support and economic stress. 33.9% of the men and 35.7% of the women had low trust. The significantly higher odds ratios of low trust for unmarried men and women and divorced men remained throughout the analyses, while the significant association disappeared for divorced women in the final model. In contrast, the odds ratios of low trust for widows/widowers remained not significant compared to the married/cohabitating category throughout the analyses.     

Why does myopia decrease the willingness to invest? Is it myopic loss aversion or myopic loss probability aversion?

For loss averse investors, a sequence of risky investments looks less attractive if it is evaluated myopically—an effect called myopic loss aversion (MLA). The consequences of this effect have been confirmed in several experiments and its robustness is largely undisputed. The effect’s causes, however, have not been thoroughly examined with regard to one important aspect. Due to the construction of the lotteries that were used in the experiments, none of the studies is able to distinguish between MLA and an explanation based on (myopic) loss probability aversion (MLPA). This distinction is important, however, in discussion of the practical relevance and the generalizability of the phenomenon. We designed an experiment that is able to disentangle lottery attractiveness and loss probabilities. Our analysis reveals that mere loss probabilities are not as important in this dynamic context as previous findings in other domains suggest. The results favor the MLA over the MLPA explanation.     

Common Learning

Consider two agents who learn the value of an unknown parameter by observing a sequence of private signals. The signals are independent and identically distributed across time but not necessarily across agents. We show that when each agent's signal space is finite, the agents will commonly learn the value of the parameter, that is, that the true value of the parameter will become approximate common knowledge. The essential step in this argument is to express the expectation of one agent's signals, conditional on those of the other agent, in terms of a Markov chain. This allows us to invoke a contraction mapping principle ensuring that if one agent's signals are close to those expected under a particular value of the parameter, then that agent expects the other agent's signals to be even closer to those expected under the parameter value. In contrast, if the agents' observations come from a countably infinite signal space, then this contraction mapping property fails. We show by example that common learning can fail in this case.     

Global operations strategy: Coordinating manufacturing networks

This paper presents a concept that describes how companies can manage their international operations so as to facilitate the coordination of their manufacturing networks. The research presented originates from a model that was developed at the Swedish telecommunications company Ericsson in the mid-1990s, but has since then been further elaborated. More specifically, the purpose of this paper is to show how Ericsson Radio Systems incorporated the recent research on manufacturing networks found in literature in their global operations strategy, and to present the conceptual model that was the result of these efforts. The conceptual model described in this paper focuses on the blending of cost competitiveness, flexibility, and innovativeness; a combination termed the “transnational solution” in the literature. In addition to a literature review on manufacturing networks and global operations and the proposed conceptual model, the paper also contains a case illustration showing how Ericsson has implemented a version of the conceptual model so that their global operations strategy realizes the transnational solution.     

PARTY FORMATION IN SINGLE‐ISSUE POLITICS

We study the implications of economies of party size in a model of party formation. We show that when the policy space is one‐dimensional, candidates form at most two parties. This result does not depend on the magnitude of the economies of party size or sensitively on the nature of the individuals' preferences. It does depend on our assumptions that the policy space is one‐dimensional and that uncertainty is absent; we study how modifications of these assumptions affect our conclusions. (JEL: D70, D72)     

Trade Unions,Wage Bargaining Coordination,and Foreign Direct Investment

Conventional wisdom is that a high trade union bargaining strength and a system of coordinated wage bargaining reduce the attractiveness of an economy as a location for foreign direct investment, although there is limited evidence for this. The paper takes panel data for 19 OECD economies to examine the relationship between trade union bargaining strength, bargaining coordi nation, and a range of incentives for inward foreign direct investment. It finds a strong negative effect of trade union density on inward foreign direct investment, which is dependent on the degree of wage bargaining coordination. A high degree of coordination weakens the deterrent effect of high union density, which is consistent with the notion that under certain circumstances a coordinated increase in wages can increase profits of the multinationals by hurting domestic firms.     

Leadership and team cohesiveness across cultures

This study examines the relation between leadership and team cohesiveness in different societal cultures. We expect direct effects of societal culture on leadership and team cohesiveness, as well as a moderating effect of culture on the relationship between leadership and cohesiveness. Data were collected from 29,868 managers and 138,270 corresponding team members in 80 countries. Multilevel analysis was used to test the hypotheses, relating societal individualism–collectivism (IC), with directive and supportive leadership, and with team cohesiveness. In individualistic societies managers use less directive and less supportive behavior, compared with collectivistic societies. Team cohesiveness is not directly related with IC. Directive leadership and supportive leadership are negatively and positively related with team cohesiveness respectively and these relations are stronger in individualistic societies. Implications for managerial education and practices are discussed.     

Flows with unit path capacities and related packing and covering problems

Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest. Starting from an LP formulation of the maximum s-t-flow problem in path variables, we introduce unit upper bounds on the amount of flow being sent along each path. The resulting (fractional) flow problem is NP-hard; its integral version is strongly NP-hard already on very simple classes of graphs. For the fractional problem we present an FPTAS that is based on solving the k shortest paths problem iteratively. We show that the integral problem is hard to approximate and give an interesting O(log?m)-approximation algorithm, where m is the number of arcs in the considered graph. For the multicommodity version of the problem there is an $O(\sqrt{m})Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest. Starting from an LP formulation of the maximum s-t-flow problem in path variables, we introduce unit upper bounds on the amount of flow being sent along each path. The resulting (fractional) flow problem is NP-hard; its integral version is strongly NP-hard already on very simple classes of graphs. For the fractional problem we present an FPTAS that is based on solving the k shortest paths problem iteratively. We show that the integral problem is hard to approximate and give an interesting O(log m)-approximation algorithm, where m is the number of arcs in the considered graph. For the multicommodity version of the problem there is an O(?m)O(\sqrt{m}) -approximation algorithm. We argue that this performance guarantee is best possible, unless P=NP.