Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

On the Gaussian Many-to-One X Channel

In this paper, the Gaussian many-to-one X channel (XC), which is a special case of general multiuser XC, is studied. In the Gaussian many-to-one XC, communication links exist between all transmitters and one of the receivers, along with a communication link between each transmitter and its corresponding receiver. As per the XC assumption, transmission of messages is allowed on all the links of the channel. This communication model is different from the corresponding manyto- one interference channel (IC). Transmission strategies, which involve using Gaussian codebooks and treating interference from a subset of transmitters as noise, are formulated for the above channel. Sum-rate is used as the criterion of optimality for evaluating the strategies. Initially, a 3 x 3 many-to-one XC is considered and three transmission strategies are analyzed. The first two strategies are shown to achieve sum-rate capacity under certain channel conditions. For the third strategy, a sum-rate outer bound is derived and the gap between the outer bound and the achieved rate is characterized. These results are later extended to the K x K case. Next, a region in which the many-to-one XC can be operated as a many-to-one IC without the loss of sum-rate is identified. Furthermore, in the above region, it is shown that using Gaussian codebooks and treating interference as noise achieve a rate point that is within K/2 -1 bits from the sum-rate capacity. Subsequently, some implications of the above results to the Gaussian many-to-one IC are discussed. Transmission strategies for the many-to-one IC are formulated, and channel conditions under which the strategies achieve sum-rate capacity are obtained. A region where the sum-rate capacity can be characterized to within K/2 -1 bits is also identified. Finally, the regions where the derived channel conditions are satisfied for each strategy are illustrated for a 3 x 3 many-to-one XC and the corresponding many-to-one IC.

Matching Markets under (In)complete Information

We are the first to introduce incomplete information to centralized many-to-one matching markets such as those to entry-level labor markets or college admissions. This is important because in real life markets (i) any agent is uncertain about the other agents' true preferences and (ii) most entry-level matching is many-to-one (and not one-to-one). We show that for stable (matching) mechanisms there is a strong and surprising link between Nash equilibria under complete information and Bayesian Nash equilibria under incomplete information. That is,given a common belief, a strategy profile is a Bayesian Nash equilibrium under incomplete information in a stable mechanism if and only if, for any true profile in the support of the common belief, the submitted profile is a Nash equilibrium under complete information at the true profile in the direct preference revelation game induced by the stable mechanism. This result may help to explain the success of stable mechanisms in these markets.

QoE-aware power management in vehicle-to-grid networks:a matching-theoretic approach

Frequency, time and places of charging and discharging have critical impact on the Quality of Experience (QoE) of using Electric Vehicles (EVs). EV charging and discharging scheduling schemes should consider both the QoE of using EV and the load capacity of the power grid. In this paper, we design a traveling plan-aware scheduling scheme for EV charging in driving pattern and a cooperative EV charging and discharging scheme in parking pattern to improve the QoE of using EV and enhance the reliability of the power grid. For traveling planaware scheduling, the assignment of EVs to Charging Stations (CSs) is modeled as a many-to-one matching game and the Stable Matching Algorithm (SMA) is proposed. For cooperative EV charging and discharging in parking pattern, the electricity exchange between charging EVs and discharging EVs in the same parking lot is formulated as a many-to-many matching model with ties, and we develop the Pareto Optimal Matching Algorithm (POMA). Simulation results indicates that the SMA can significantly improve the average system utility for EV charging in driving pattern, and the POMA can increase the amount of electricity offloaded from the grid which is helpful to enhance the reliability of the power grid.

Von Neumann-Morgenstern Stable Sets in Matching Problems

The following properties of the core of a one well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characterization of (von Neumann-Morgenstern) stable sets in one-to-one matching problem only if it is a maximal set satisfying the following properties : (a) the core is a subset of the set; (b) the set is a lattice; (c) the set of unmatched agents is identical for any two matchings belonging to the set. Furthermore, a set is a stable set if it is the unique maximal set satisfying properties (a), (b) and (c). We also show that our main result does not extend from one-to-one matching problems to many-to-one matching problems.

Matching theory based travel plan aware charging algorithms in V2G smart grid networks

The frequency, time and places of charging have large impact on the Quality of Experience (QoE) of EV drivers. It is critical to design effective EV charging scheduling system to improve the QoE of EV drivers. In order to improve EV charging QoE and utilization of CSs, we develop an innovative travel plan aware charging scheduling scheme for moving EVs to be charged at Charging Stations (CS). In the design of the proposed charging scheduling scheme for moving EVs, the travel routes of EVs and the utility of CSs are taken into consideration. The assignment of EVs to CSs is modeled as a two-sided many-to-one matching game with the objective of maximizing the system utility which reflects the satisfactory degrees of EVs and the profits of CSs. A Stable Matching Algorithm (SMA) is proposed to seek stable matching between charging EVs and CSs. Furthermore, an improved Learning based On-LiNe scheduling Algorithm (LONA) is proposed to be executed by each CS in a distributed manner. The performance gain of the average system utility by the SMA is up to 38.2% comparing to the Random Charging Scheduling (RCS) algorithm, and 4.67% comparing to Only utility of Electric Vehicle Concerned (OEVC) scheme. The effectiveness of the proposed SMA and LONA is also demonstrated by simulations in terms of the satisfactory ratio of charging EVs and the the convergence speed of iteration.

On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets

We consider two–sided many–to–many matching markets in which each worker may work for multiple firms and each firm may hire multiple workers. We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipulations that have been reported and studied in empirical and theoretical work: truncation strategies, which are the lists obtained by removing a tail of least preferred partners from a preference list, and the more general dropping strategies, which are the lists obtained by only removing partners from a preference list (i.e., no reshuffling). We study when truncation / dropping strategies are exhaustive for a group of agents on the same side of the market, i.e., when each match resulting from preference manipulations can be replicated or improved upon by some truncation / dropping strategies. We prove that for each stable mechanism, truncation strategies are exhaustive for each agent with quota 1 (Theorem 1). We show that this result cannot be extended neither to group manipulations (even when all quotas equal 1 – Example 1), nor to individual manipulations when the agent’s quota is larger than 1 (even when all other agents’ quotas equal 1 – Example 2). Finally, we prove that for each stable mechanism, dropping strategies are exhaustive for each group of agents on the same side of the market (Theorem 2), i.e., independently of the quotas.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

Extended application of edge-to-edge matching model to HCP/HCP (alpha-Mg/MgZn2) system in magnesium alloys

In the present work, the edge-to-edge matching model has been introduced to predict the orientation relationships (OR) between the MgZn2 phase which has hexagonal close packed (HCP) structure and the HCP a-Mg matrix. Based on the crystal structures and lattice parameters only, the model has predicted the two most preferred ORs and they are: (1) [1 1 2 3](alpha-Mg) vertical bar vertical bar]1 1 2 3](alpha-Mg), (0 0 0 1)(alpha-Mg) 0.27 degrees from (0 0 0 1)(MgZn2), (1 0 1 1)(alpha-Mg) 26.18 degrees from (1 1 2 2)(MgZn2), (2) [1 0 1 0](alpha-Mg),vertical bar vertical bar[1 1 2 0](MgZn2), (0 0 0 1)(alpha-Mg) vertical bar vertical bar(0 0 0 1)(MgZn2), (1 0 1 1)(alpha-Mg) 3.28 degrees from ( 1 1 2 2)(MgZn2). Four experimental ORs have been reported in the alpha-Mg/MgZn2 system, and the most frequently reported one is ideally the OR (2). The other three experimental ORs are near versions of the OR (2). The habit plane of the OR (2) has been predicted and it agrees well with the experimental results.

Design and evaluation of tinnitus synthesis methods: From spectral to spatial matching

Purpose
This study was designed to investigate methods to help patients suffering from unilateral tinnitus synthesizing an auditory replica of their tinnitus.

Materials and methods
Two semi-automatic methods (A and B) derived from the auditory threshold of the patient and a method (C) combining a pure tone and a narrow band-pass noise centred on an adjustable frequency were devised and rated on their likeness over two test sessions. A third test evaluated the stability over time of the synthesized tinnitus replica built with method C, and its proneness to merge with the patient's tinnitus. Patients were then asked to try and control the lateralisation of this single percept through the adjustment of the tinnitus replica level.

Results
The first two tests showed that seven out of ten patients chose the tinnitus replica built with method C as their preferred one. The third test, performed on twelve patients, revealed pitch tuning was rather stable over a week interval. It showed that eight patients were able to consistently match the central frequency of the synthesized tinnitus (presented to the contralateral ear) to their own tinnitus, which leaded to a unique tinnitus percept. The lateralisation displacement was consistent across patients and revealed an average range of 29dB to obtain a full lateral shift from the ipsilateral to the contralateral side.

Conclusions
Although spectrally simpler than the semi-automatic methods, method C could replicate patients' tinnitus, to some extent. When a unique percept between synthesized tinnitus and patients' tinnitus arose, lateralisation of this percept was achieved.

Cournot model with investments to change the market size

We present a new deterministic dynamical model on the market size of Cournot competitions, based on Nash equilibria of R&D investment strategies to increase the size of the market of the firms at every period of the game. We compute the unique Nash equilibrium for the second subgame and the profit functions for both firms. Adding uncertainty to the R&D investment strategies, we get a new stochastic dynamical model and we analyse the importance of the uncertainty to reverse the initial advantage of one firm with respect to the other.

Hedging effectiveness of total returns swaps: application to the Japanese market

The development of the real estate swap market offers many opportunities for investors to adjust the exposure of their portfolios to real estate. A number of OTC transactions have been observed in markets around the world. In this paper we examine the Japanese commercial real estate market from the point of view of an investor holding a portfolio of properties seeking to reduce the portfolio exposure to the real estate market by swapping an index of real estate for LIBOR. This paper explores the practicalities of hedging portfolios comprising small numbers of individual properties against an appropriate index. We use the returns from 74 properties owned by Japanese Real Estate Investment Trusts over the period up to September 2007. The paper also discusses and applies the appropriate stochastic processes required to model real estate returns in this application and presents alternative ways of reporting hedging effectiveness. We find that the development of the derivative does provide the capacity for hedging market risk but that the effectiveness of the hedge varies considerably over time. We explore the factors that cause this variability.

The notions of 'restriction' and 'discrimination' in the context of the free movement of persons provisions: from a relationship of interdependence to one of (almost complete) independence

This article aims to analyse how the meaning of the notions of ‘restrictions’ and ‘discrimination’ in EU free movement law has developed through the years, and to explore how the relationship between them has evolved. It is explained that the two concepts under examination had originally been closely intertwined, in the sense that one defined the other, the element holding them together being the aim of the relevant provisions to liberalise the inter-State movement of persons in the EU, as part of the process of establishing an internal market. Yet, more recently, the way that the Court has chosen to delimit their scope, illustrates that each of these notions can now have a life of its own, meaning that ‘discrimination’ can include discriminatory measures which do not lead to restrictions that are contrary to the free movement provisions, and ‘restriction’ can cover national measures that are not discriminatory.

The functions of intermediaries in Swedish SMEs internationalization to the Nigerian market

Over the years so many academic literatures has revealed that increased number of firms have seen internationalization as a means to gain and sustain competitive advantage and even increase economic of scale, and this has led many western companies to emerging markets. In this paper we discovered that among the pool of Swedish firms, only the MNEs have seen Nigerian market attractive to internationalize to, but just a few of the Swedish SMEs has expanded to the Nigerian market. This research was conducted by doing a qualitative study with the use of phenomenological research approach, during our investigation on the functions of intermediaries in Swedish SMEs internationalization to Nigeria market.Furthermore, we were able to understand the importance and functions of the different marketing intermediaries’ in Swedish SMEs internationalization to Nigeria market. These intermediaries equip the Swedish firms with the required objective knowledge of the Nigerian market, updating them with recent development of the opportunities and threats involved in the Nigerian marketing environment, and linking these Swedish firms to the required government departments, distributors, agent/broker, customers, middle men etc, thereby impacting them with the experiential knowledge. Moreover, it is important for firms to have objective or pre-market knowledge of a particular market before entering that market, but this knowledge is regarded as non-helpful knowledge to firms. But the experiential knowledge is acquired over time in the market, which is regarded as the helpful knowledge. It is evident that the intermediaries equip these firms with both objective and experiential knowledge.Although the opportunities in some emerging markets are very attractive, but the threats in these markets are other factors firms also put into consideration before internationalizing to these markets. This is why thorough market research has to be done so that firms can create effective marketing strategies when they want to expand their marketing activities to emerging markets. Despite the risk and uncertainties involved in doing business in foreign countries, still yet companies selling global products do not have any choice than to internationalize their marketing operations.

Relating one's social support network to one's mid term grade

Much has been written about the relation of social support to health outcomes. Support networks were found to be predictive of health status. Not so clear was the manner in which social support helped the individual to avoid health complications. Whereas some aspects of the support network were protective, others were burdensome. Duties to one's network could serve as a stressor and duties outside one's network might stress the support system itself. Exposure to one's network was associated with certain health risks while disruption in one's social support network was associated with other health risks.^ Many factors contributed to the impact of a social support network upon the individual member: the characteristics of the individual, the individual's role or position within the network, qualities of the network and duties or indebtedness of the individual to the network. This investigation considered the possibility that performance could serve as a stressor in a fashion similar to an exposure to a health hazard.^ Because the literature includes many examples of studies in which the subjects were college students, academic progress is a performance common to most subjects. A profile of the support networks of successful students was contrasted with those of less successful students in this correlational study.^ What was uncovered in this investigation was a very complex web of interrelated constructs. Most aspects of the social support network did not significantly predict academic performance. Only a limited number of characteristics were associated with academic success: the frequency of support, student age, the existence of a 'mentor' within one' s network, and the extent to which one received a predominant source of support. Other factors had a tendency to be negatively correlated with midterm grade, suggesting those factors may impede academic performance.^ Medical status did not predict grades, but was correlated with many aspects of the network. Disruptions in particular parts of one's network were correlated with particular health categories. In fact, disruption in social support was more predictive of academic outcomes than medical complications. Whereas the individual's values were related to the contributing factors, only the individual's satisfaction with certain aspects of the support network were predictive of higher midterm grades in a psychology class. Dissatisfaction was associated with lower grades, suggesting a disruptive effect within the network. Associations among the features of support networks which predicted academic progress were considered. ^