884 resultados para Competition Map
Resumo:
Brand competition is modelled using an agent based approach in order to examine the long run dynamics of market structure and brand characteristics. A repeated game is designed where myopic firms choose strategies based on beliefs about their rivals and consumers. Consumers are heterogeneous and can observe neighbour behaviour through social networks. Although firms do not observe them, the social networks have a significant impact on the emerging market structure. Presence of networks tends to polarize market share and leads to higher volatility in brands. Yet convergence in brand characteristics usually happens whenever the market reaches a steady state. Scale-free networks accentuate the polarization and volatility more than small world or random networks. Unilateral innovations are less frequent under social networks.
Resumo:
Background The information processing capacity of the human mind is limited, as is evidenced by the attentional blink (AB) - a deficit in identifying the second of two temporally-close targets (T1 and T2) embedded in a rapid stream of distracters. Theories of the AB generally agree that it results from competition between stimuli for conscious representation. However, they disagree in the specific mechanisms, in particular about how attentional processing of T1 determines the AB to T2. Methodology/Principal Findings The present study used the high spatial resolution of functional magnetic resonance imaging (fMRI) to examine the neural mechanisms underlying the AB. Our research approach was to design T1 and T2 stimuli that activate distinguishable brain areas involved in visual categorization and representation. ROI and functional connectivity analyses were then used to examine how attentional processing of T1, as indexed by activity in the T1 representation area, affected T2 processing. Our main finding was that attentional processing of T1 at the level of the visual cortex predicted T2 detection rates Those individuals who activated the T1 encoding area more strongly in blink versus no-blink trials generally detected T2 on a lower percentage of trials. The coupling of activity between T1 and T2 representation areas did not vary as a function of conscious T2 perception. Conclusions/Significance These data are consistent with the notion that the AB is related to attentional demands of T1 for selection, and indicate that these demands are reflected at the level of visual cortex. They also highlight the importance of individual differences in attentional settings in explaining AB task performance.
Resumo:
During the financial crisis, companies and lenders found themselves in distressed situations. Competition authorities across the globe had to deal with controversial issues such as the application of the failing firm defence in merger transactions as well as assessment of emergency aid granted by states. This article considers competition policy in periods of crisis, in particular the failing firm defence in merger control and its state aid policy.
Resumo:
We study the heat, linear Schrodinger and linear KdV equations in the domain l(t) < x < ∞, 0 < t < T, with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.
Resumo:
A novel extension to Kohonen's self-organising map, called the plastic self organising map (PSOM), is presented. PSOM is unlike any other network because it only has one phase of operation. The PSOM does not go through a training cycle before testing, like the SOM does and its variants. Each pattern is thus treated identically for all time. The algorithm uses a graph structure to represent data and can add or remove neurons to learn dynamic nonstationary pattern sets. The network is tested on a real world radar application and an artificial nonstationary problem.