All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Multicast algorithms evaluation using an adaptative routing in ATM networks

This paper proposes a multicast implementation based on adaptive routing with anticipated calculation. Three different cost measures for a point-to-multipoint connection: bandwidth cost, connection establishment cost and switching cost can be considered. The application of the method based on pre-evaluated routing tables makes possible the reduction of bandwidth cost and connection establishment cost individually

Incorporating waiting time in competitive location models: formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market share. This problem is hard to solve using standard optimization techniques. Metaheuristics are shown to offer accurate results within acceptable computing times.

Market versus limit orders in an imperfectly competitive security

This paper analyzes the choice between limit and market orders in animperfectly competitive noisy rational expectations economy. There is a uniqueinsider, who takes into account the effect their trading has on prices. If theinsider behaves as a price taker, she will choose market orders if her privateinformation is very precise and she will choose limit orders otherwise. On thecontrary, if the insider recognizes and exploits her ability to affect themarket price, her optimal choice is to place limit orders whatever the precisionof her private information.

Competitive location and pricing on networks

In this paper we consider a location and pricing model for a retail firm that wants to enter a spatial market where a competitor firm is already operating as a monopoly with several outlets. The entering firms seeks to determine the optimal uniform mill price and its servers' locations that maximizes profits given the reaction in price of the competitor firm to its entrance. A tabu search procedure is presentedto solve the model together with computational experience.

Location of hubs in a competitive environment

We offer a formulation that locates hubs on a network in a competitiveenvironment; that is, customer capture is sought, which happenswhenever the location of a new hub results in a reduction of thecurrent cost (time, distance) needed by the traffic that goes from thespecified origin to the specified destination.The formulation presented here reduces the number of variables andconstraints as compared to existing covering models. This model issuited for both air passenger and cargo transportation.In this model, each origin-destination flow can go through either oneor two hubs, and each demand point can be assigned to more than a hub,depending on the different destinations of its traffic. Links(``spokes'' have no capacity limit. Computational experience is provided.

Psychological pressure in competitive environments: Evidence from a randomized natural experiment

Much like cognitive abilities, emotional skills can have major effects on performance and economic outcomes. This paper studies the behavior of professionalsubjects involved in a dynamic competition in their own natural environment. Thesetting is a penalty shoot-out in soccer where two teams compete in a tournamentframework taking turns in a sequence of five penalty kicks each. As the kicking order is determined by the random outcome of a coin flip, the treatment and control groups are determined via explicit randomization. Therefore, absent any psychological effects, both teams should have the same probability of winning regardless of the kicking order. Yet, we find a systematic first-kicker advantage. Using data on 2,731 penalty kicks from 262 shoot-outs for a three decade period, we find that teams kicking first win the penalty shoot-out 60.5% of the time. A dynamic panel data analysis shows that the psychological mechanism underlying this result arises from the asymmetry in the partial score. As most kicks are scored, kicking first typically means having the opportunity to lead in the partial score, whereas kicking second typically means lagging in the score and having the opportunity to, at most, get even. Having a worse prospect than the opponent hinders subjects' performance.Further, we also find that professionals are self-aware of their own psychological effects. When a recent change in regulations gives winners of the coin toss the chance to choose the kicking order, they rationally react to it by systematically choosing to kick first. A survey of professional players reveals that when asked to explain why they prefer to kick first, they precisely identify the psychological mechanism for which we find empirical support in the data: they want to lead in the score inorder to put pressure on the opponent.

On Rothschild-Stiglitz as competitive pooling

Dubey and Geanakoplos [2002] have developed a theory of competitive pooling, which incorporates adverse selection and signaling into general equilibrium. By recasting the Rothschild-Stiglitz model of insurance in this framework, they find that a separating equilibrium always exists and is unique.We prove that their uniqueness result is not a consequence of the framework, but rather of their definition of refined equilibria. When other types of perturbations are used, the model allows for many pooling allocations to be supported as such: in particular, this is the case for pooling allocations that Pareto dominate the separating equilibrium.

Consumer choice in competitive location models: Formulations and heuristics

A new direction of research in Competitive Location theory incorporatestheories of Consumer Choice Behavior in its models. Following thisdirection, this paper studies the importance of consumer behavior withrespect to distance or transportation costs in the optimality oflocations obtained by traditional Competitive Location models. To dothis, it considers different ways of defining a key parameter in thebasic Maximum Capture model (MAXCAP). This parameter will reflectvarious ways of taking into account distance based on several ConsumerChoice Behavior theories. The optimal locations and the deviation indemand captured when the optimal locations of the other models are usedinstead of the true ones, are computed for each model. A metaheuristicbased on GRASP and Tabu search procedure is presented to solve all themodels. Computational experience and an application to 55-node networkare also presented.

Tracking the invisible hand: Convergence of double auctions to competitive equilibrium

Economics is the science of want and scarcity. We show that want andscarcity, operating within a simple exchange institution (double auction),are sufficient for an economy consisting of multiple inter--related marketsto attain competitive equilibrium (CE). We generalize Gode and Sunder's(1993a, 1993b) single--market finding to multi--market economies, andexplore the role of the scarcity constraint in convergence of economies to CE.When the scarcity constraint is relaxed by allowing arbitrageurs in multiple markets to enter speculative trades, prices still converge to CE,but allocative efficiency of the economy drops. \\Optimization by individual agents, often used to derive competitive equilibria,are unnecessary for an actual economy to approximately attain such equilibria.From the failure of humans to optimize in complex tasks, one need not concludethat the equilibria derived from the competitive model are descriptivelyirrelevant. We show that even in complex economic systems, such equilibriacan be attained under a range of surprisingly weak assumptions about agentbehavior.

Supply chain management as a competitive advantage in the Spanish grocery sector

Adversarial relationships have long dominated business relationships,but Supply Chain Management (SCM) entails a new perspective. SCM requiresa movement away from arms-length relationships toward partnership stylerelations. SCM involves integration, co-ordination and collaborationacross organisations and throughout the supply chain. It means that SCMrequires internal (intraorganisational) and external (interorganisational)integration. This paper analyses the relationship between internal andexternal integration processes, their effect on firms performance andtheir contribution to the achievement of a competitive advantage.Performance improvements are analysed through costs, stock out and leadtime reductions. And, the achievement of a better competitive positionis measured by comparing the firm s performance with its competitors performance. To analyse this, an empirical study has been conducted inthe Spanish grocery sector.

A note on the convergence to competitive equilibria in economies with moral hazard

We examine the conditions under which competitive equilibria can beobtained as the limit, when the number of strategic traders getslarge, of Nash equilibria in economies with asymmetric informationon agents' effort and possibly imperfect observability of agents'trades. Convergence always occur when either effort is publiclyobserved (no matter what is the information available tointermediaries on agents' trades); or effort is private informationbut agents' trades are perfectly observed; or no information at allis available on agents' trades. On the other hand, when eachintermediary can observe its trades with an agent, but not theagent's trades with other intermediaries, the (Nash) equilibriawith strategic intermediaries do not converge to any of thecompetitive equilibria, for an open set of economies. The source ofthe difficulties for convergence is the combination of asymmetricinformation and the restrictions on the observability of tradeswhich prevent the formation of exclusive contractual relationshipsand generate barriers to entry in the markets for contracts.

Incorporating waiting time in competitive location models: Formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum CaptureProblem. In the original MCP, market capture is obtained by lower traveling distances or lowertraveling time, in this new version not only the traveling time but also the waiting time willaffect the market share. This problem is hard to solve using standard optimization techniques.Metaheuristics are shown to offer accurate results within acceptable computing times.

Organized vs. competitive corruption

We study bureaucratic corruption in a model in which a constituencysets required levels for a given set of activities. Each activity iscarried out by an external provider, and its realization is supervisedby a bureaucrat. While bureaucrats are supposed to act on behalf of theconstituency, they can decide to be corrupt and allow providers todeliver lower activity levels than contracted in exchange for a bribe.Given this, the constituency sets the optimal activity levels weighingoff the value of activity levels, their costs, as well as the possibilityfor the bureaucrats to be corrupt. We use this setup to study the impacton equilibrium corruption of the degree of decentralization of corruption.To do this we compute equilibrium corruption in two different settings:1) Each bureaucrat acts in such a way as to maximize his own individualutility (competitive corruption); 2) An illegal syndicate oversee thecorruption decisions of the population of bureaucrats in such a way asto maximize total proceeds from corruption (organized corruption). Weshow that, since average corruption payoff is increasing in the activitylevels set by the constituency, and since the latter responds to highlevels of corruption by reducing required activity levels, in equilibriumthe illegal syndicate acts in such a way as to restrain the total numberof corrupt transactions, so that corruption is lower when it is organizedthan when it is competitive.