The Stability of the Roommate Problem Revisited

The lack of stability in some matching problems suggests that alternative solution concepts to the core might be applied to find predictable matchings. We propose the absorbing sets as a solution for the class of roommate problems with strict preferences. This solution, which always exists, either gives the matchings in the core or predicts some other matchings when the core is empty. Furthermore, it satisfies an interesting property of outer stability. We also characterize the absorbing sets, determine their number and, in case of multiplicity, we find that they all share a similar structure.

Choice of Flexible Production Technologies Under Strategic Delegation

This work analyzes a managerial delegation model in which firms can choose between a flexible production technology which allows them to produce two different products and a dedicated production technology which limits production to only one product. We analyze whether the incentives to adopt the flexible technology are smaller or greater in a managerial delegation model than under strict profit maximization. We obtain that the asymmetric equilibrium in which only one firm adopts the flexible technology can be sustained under strategic delegation but not under strict profit maximization when products are substitutes. We extend the analysis to consider welfare implications.

Cost-Saving production technologies and strategic delegation

This work analyzes a managerial delegation model in which firms that produce a differentiated good can choose between two production technologies: a low marginal cost technology and a high marginal cost technology. For the former to be adopted more investment is needed than for the latter. By giving managers of firms an incentive scheme based on a linear combination of profit and sales revenue, we find that Bertrand competition provides a stronger incentive to adopt the cost-saving technology than the strict profit maximization case. However, the results may be reversed under Cournot competition. We show that if the degree of product substitutability is sufficiently low (high), the incentive to adopt the cost-saving technology is larger under strict profit maximization (strategic delegation).

A Model of Evolutionay Drift

Drift appears to be crucial to study the stability properties of Nash equilibria in a component specifying different out-of-equilibrium behaviour. We propose a new microeconomic model of drift to be added to the learning process by which agents find their way to equilibrium. A key feature of the model is the sensitivity of the noisy agent to the proportion of agents in his player population playing the same strategy as his current one. We show that, 1. Perturbed Payoff-Positive and PayoffMonotone selection dynamics are capable of stabilizing pure non strict Nash equilibria in either singleton or nonsingleton component of equilibria; 2. The model is relevant to understand the role of drift in the behaviour observed in the laboratory for the Ultimatum Game and for predicting outcomes that can be experimentally tested. Hence, the selection dynamics model perturbed with the proposed drift may be seen as well as a new learning tool to understand observed behaviour.

El problema de la causalidad en las ciencias económicas

[ES] En el presente artículo se aborda el problema de la causalidad en las Ciencias Económicas. Partiendo de la diferenciación entre ciencias duras y blandas, y de la supuesta clasificicación de la economía en este segundo grupo, se realiza un análisis de los diferentes paradigmas ontológicos que soportan la investigación científica, para a continuación trasladar la causalidad desde el ámbito ontológico al gnoseológico. Posteriormente se profundiza en la conjunción de la metodología hipotético-deductiva con el método correlacional, generando una causalidad probabilística. Dicha causalidad, contextualizada de forma científica, permite la realización y contrastación de inferencias predictivas, a través de las cuales las Ciencias Ecnómicas pueden encontrar su ubicación en los niveles mas extrictos de la investigación científica.

Développement des méthodes de stabilisation pour la conception des circuits hyperfréquences : application à l'optimisation d'un amplificateur de puissance spatial

209 p. : graf.

Extended ageing time and temperature effects on quality of sub-primal cuts of boxed beef

[EN]Most of the information indicating ageing improves tenderness has been collected on the loin and rib-eye muscles over relatively short ageing times, assuming that all muscles will react similarly. In the present study, the effect of extended ageing times on instrumental texture (56 d) and sensory characteristics (42 d) of six different beef sub-primals [striploin (SL), inside round (IR), outside round (OR), eye of round (ER), blade eye (BE) and chuck tender (CT)] was studied. The effects of two ageing temperatures (1and 58C) were also compared. In general, ageing increased tenderness (P<0.05) of SL, BE, ER and CT sub-primals, although BE shear force increased after 42 d of ageing. On the other hand, ageing had no effect on IR tenderness (P<0.05) and resulted in a decrease in tenderness of OR (P<0.05) until day 35, with a later increase after 42 d of ageing. Increasing ageing temperature (58C) had limited effect on tenderness, but ageing time and temperature increases led to lower flavour and higher off-flavour intensity (P<0.05) of the studied sub-primals. These results suggest that cutspecific maximum ageing times and rigid adherence to temperature maximums would be of benefit to optimize postslaughter processes and meat quality

The von Neumann-Morgenstern stable sets for 2x2 games

We analyze the von Neumann and Morgenstern stable sets for the mixed extension of 2 2 games when only single profitable deviations are allowed. We show that the games without a strict Nash equilibrium have a unique vN&M stable set and otherwise they have infinite sets.

Information Preservation (IP) Method in Simulation

This paper reviews firstly methods for treating low speed rarefied gas flows: the linearised Boltzmann equation, the Lattice Boltzmann method (LBM), the Navier-Stokes equation plus slip boundary conditions and the DSMC method, and discusses the difficulties in simulating low speed transitional MEMS flows, especially the internal flows. In particular, the present version of the LBM is shown unfeasible for simulation of MEMS flow in transitional regime. The information preservation (IP) method overcomes the difficulty of the statistical simulation caused by the small information to noise ratio for low speed flows by preserving the average information of the enormous number of molecules a simulated molecule represents. A kind of validation of the method is given in this paper. The specificities of the internal flows in MEMS, i.e. the low speed and the large length to width ratio, result in the problem of elliptic nature of the necessity to regulate the inlet and outlet boundary conditions that influence each other. Through the example of the IP calculation of the microchannel (thousands long) flow it is shown that the adoption of the conservative scheme of the mass conservation equation and the super relaxation method resolves this problem successfully. With employment of the same measures the IP method solves the thin film air bearing problem in transitional regime for authentic hard disc write/read head length ( ) and provides pressure distribution in full agreement with the generalized Reynolds equation, while before this the DSMC check of the validity of the Reynolds equation was done only for short ( ) drive head. The author suggests degenerate the Reynolds equation to solve the microchannel flow problem in transitional regime, thus provides a means with merit of strict kinetic theory for testing various methods intending to treat the internal MEMS flows.

Information preservation (IP) method in simulation of internal rarefied gas flows in MEMS

This paper reviews firstly methods for treating low speed rarefied gas flows: the linearised Boltzmann equation, the Lattice Boltzmann method (LBM), the Navier-Stokes equation plus slip boundary conditions and the DSMC method, and discusses the difficulties in simulating low speed transitional MEMS flows, especially the internal flows. In particular, the present version of the LBM is shown unfeasible for simulation of MEMS flow in transitional regime. The information preservation (IP) method overcomes the difficulty of the statistical simulation caused by the small information to noise ratio for low speed flows by preserving the average information of the enormous number of molecules a simulated molecule represents. A kind of validation of the method is given in this paper. The specificities of the internal flows in MEMS, i.e. the low speed and the large length to width ratio, result in the problem of elliptic nature of the necessity to regulate the inlet and outlet boundary conditions that influence each other. Through the example of the IP calculation of the microchannel (thousands m ? long) flow it is shown that the adoption of the conservative scheme of the mass conservation equation and the super relaxation method resolves this problem successfully. With employment of the same measures the IP method solves the thin film air bearing problem in transitional regime for authentic hard disc write/read head length ( 1000 L m ? = ) and provides pressure distribution in full agreement with the generalized Reynolds equation, while before this the DSMC check of the validity of the Reynolds equation was done only for short ( 5 L m ? = ) drive head. The author suggests degenerate the Reynolds equation to solve the microchannel flow problem in transitional regime, thus provides a means with merit of strict kinetic theory for testing various methods intending to treat the internal MEMS flows.

Management of northern fur seals on the Pribilof Islands, Alaska, 1786-1981

This paper includes information about the Pribilof Islands since their discovery by Russia in 1786 and the population of northern fur seals, Cailorhinus ursinus, that return there each summer to bear young and to breed. Russia exterminated the native population of sea Oilers, Enhydra lulris, here and nearly subjected the northern fur seal to the same fate before providing proper protection. The northern fur seal was twice more exposed to extinction following the purchase of Alaska and the Pribilof Islands by the United States in 1867. Excessive harvesting was stopped as a result of strict management by the United States of the animals while on land and a treaty between Japan, Russia, Great Britain (for Canada), and the United States that provided needed protection at sea. In 1941, Japan abrogated this treaty which was replaced by a provisional agreement between Canada and the United States that protected the fur seals in the eastern North Pacific Ocean. Japan, the U.S.S.R., Canada, and the United States again insured the survival of these animals with ratification in 1957 of the "Interim Convention on the Conservation of North Pacific Fur Seals," which is still in force. Under the auspices of this Convention, the United States launched an unprecedented manipulation of the resource through controlled removal during 1956-68 of over 300,000 females considered surplus. The biological rationale for the reduction was that production of fewer pups would result in a higher pregnancy rate and increased survival, which would, in turn, produce a sustained annual harvest of 55,000-60,000 males and 10,000-30,000 females. Predicted results did not occur. The herd reduction program instead coincided with the beginning of a decline in the number of males available for harvest. Suspected but unproven causes were changes in the toll normally accounted for by predation, disease, adverse weather, and hookworms. Depletion of the animals' food supply by foreign fishing Heets and the entanglement of fur seals in trawl webbing and other debris discarded at sea became a prime suspect in altering the average annual harvest of males on the Pribilof Islands from 71,500 (1940-56) to 40,000 (1957-59) to 36,000 (1960) to 82,000 (1961) and to 27,347 (1972-81). Thus was born the concept of a research control area for fur seals, which was agreed upon by members of the Convention in 1973 and instituted by the United States on St. George Island beginning in 1974. All commercial harvesting of fur seals was stopped on St. George Island and intensive behavioral studies were begun on the now unharvested population as it responds to the moratorium and attempts to reach its natural ceiling. The results of these and other studies here and on St. Paul Island are expected to eventually permit a comparison between the dynamics of unharvested and harvested populations, which should in turn permit more precise management of fur seals as nations continue to exploit the marine resources of the North Pacific Ocean and Bering Sea. (PDF file contains 32 pages.)

Análisis histológico e inmunohistoquímico de los subtipos de enfermedad liquenoide oral

176 p. : il.

Unilateral vs. Bilateral link-formation: Bridging the gap

We provide a model that bridges the gap between two benchmark models of strategic network formation: Jackson and Wolinsky' s model based on bilateral formation of links, and Bala and Goyal's two-way fl ow model, where links can be unilaterally formed. In the model introduced and studied here a link can be created unilaterally. When it is only supported by one of the two players the fl ow through the link suffers a certain decay, but when it is supported by both the fl ow runs without friction. When the decay in links supported by only one player is maximal (i.e. there is no flow) we have Jackson and Wolinsky 's connections model without decay, while when flow in such links is perfect we have Bala and Goyal' s two-way flow model. We study Nash, strict Nash and pairwise stability for the intermediate models. Efficiency and dynamics are also examined.

A new solution for the roommate problem: The Q-stable matchings

The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are incompatible with the other two solutions. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an effi cient algorithm for computing one of them. The outcome of the algorithm belongs to an absorbing set.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.