For large retail firms, management control is a valid tool with which to face the competition of global markets and to manage corporate complexity. The management control systems of global retailers have specific characteristics that stem from the geographical dispersion of their organisational units and frequently from the existence of cooperative alliances with other companies

Collaborative e-commerce have been considered as an effective waterway for underpinning advanced inter-organizational relationships. Dynamic alliance is one of novel organization structures that bring together individual entities located in an open and distributed environment temporarily for a specific goal, and combine their core competencies to improve the agility and flexibility of alliances...

This paper presents a framework to analyze global alliances and mergers in the airline industry under competition. The framework can help airlines identify partners and network structures, and help governments predict changes in social welfare before accepting or rejecting proposed mergers or alliances. The research combines profit-maximizing objectives to cost-based network design formulations...

Recent research shows that pre-existing network structure constrains the formation of new interorganizational alliances. Firms that are poorly embedded in a network structure are less likely to form alliances, because they lack the informational and reputational benefits that richlyembedded firms enjoy. This paper examines the types of ties that poorly-embedded firms can form to overcome the co...

Global processes imply that the information systems have the architecture of virtual peer-to-peer networks of autonomous permanent services. It is typical for IS supporting e-government. We s h o w t h a t there are two v ariants of such n e t works: Confederations with quite stable relations (e.g. between the IS of the oces) and alliances with temporal links (typical for e-commerce). Alliances...

A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.

A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.

The north Australian beef industry is complex and dynamic. It is strategically positioned to access new and existing export markets. To prosper in a global economy, it will require strong processing and live cattle sectors, continued rationalisation of infrastructure, uptake of appropriate technology, and the synergy obtained when industry sectors unite and cooperate to maintain market advantag...

A defensive k−alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V −A (where k is the strength of defensive k−alliance). An offensive k−alliance is a set of vertices A ⊆ V such that for every vertex v ∈ ∂A, the number of neighbors v has in A is at least k more th...