A Note on Large Deviations for the Stable Marriage of Poisson and Lebesgue with Random Appetites

Let IaS,a"e (d) be a set of centers chosen according to a Poisson point process in a"e (d) . Let psi be an allocation of a"e (d) to I in the sense of the Gale-Shapley marriage problem, with the additional feature that every center xi aI has an appetite given by a nonnegative random variable alpha. Generalizing some previous results, we study large deviations for the distance of a typical point xaa"e (d) to its center psi(x)aI, subject to some restrictions on the moments of alpha.

The stability of the equilibrium outcomes in the admission games induced by stable matching rules

A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students` strategies are given by their preferences over the colleges. We show that the college-optimal stable matching rule implements the set of stable matchings via the Nash equilibrium (NE) concept. For any other stable matching rule the strategic behavior of the students may lead to outcomes that are not stable under the true preferences. We then introduce uncertainty about the matching selected and prove that the natural solution concept is that of NE in the strong sense. A general result shows that the random stable matching rule, as well as any stable matching rule, implements the set of stable matchings via NE in the strong sense. Precise answers are given to the strategic questions raised.

Employment by lotto revisited

We study employment by lotto (Aldershof et al., 1999), a matching algorithm for the so-called stable marriage problem. We complement Aldershof et al.'s analysis in two ways. First, we give an alternative and intuitive description of employment by lotto. Second, we disprove Aldershof et al.'s conjectures concerning employment by lotto for general matching markets.

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.

Reasoning with incomplete and imprecise preferences

Preferences are present in many real life situations but it is often difficult to quantify them giving a precise value. Sometimes preference values may be missing because of privacy reasons or because they are expensive to obtain or to produce. In some other situations the user of an automated system may have a vague idea of whats he wants. In this thesis we considered the general formalism of soft constraints, where preferences play a crucial role and we extended such a framework to handle both incomplete and imprecise preferences. In particular we provided new theoretical frameworks to handle such kinds of preferences. By admitting missing or imprecise preferences, solving a soft constraint problem becomes a different task. In fact, the new goal is to find solutions which are the best ones independently of the precise value the each preference may have. With this in mind we defined two notions of optimality: the possibly optimal solutions and the necessary optimal solutions, which are optimal no matter we assign a precise value to a missing or imprecise preference. We provided several algorithms, bases on both systematic and local search approaches, to find such kind of solutions. Moreover, we also studied the impact of our techniques also in a specific class of problems (the stable marriage problems) where imprecision and incompleteness have a specific meaning and up to now have been tackled with different techniques. In the context of the classical stable marriage problem we developed a fair method to randomly generate stable marriages of a given problem instance. Furthermore, we adapted our techniques to solve stable marriage problems with ties and incomplete lists, which are known to be NP-hard, obtaining good results both in terms of size of the returned marriage and in terms of steps need to find a solution.

Why did the perfect marriage end : case Cloetta Fazer

Mergers are often used purposeful strategic tool. Previous research has mainly concentrated on actu-al M&A process and to elements leading to that decision. Purpose of this study is to approach de-merger of Cloetta Fazer and research what were the reasons that lead to demerger. Problem is ap-proached by first evaluating was the merger an success in the first place, as described in earlier stud-ies, media and academic research. From this information the motives for demerger are approached. Research material for study is collected from second hand sources. Research data-sample was di-vided into two categories: Timeline Sample & Additional Information Sample. Timeline sample was collected by systematically collecting news from Sanoma News database and Alma News database. This data was indexed and a timeline was constructed. From this timeline key dates, themes and elements were identified and further data gathering was concentrated based on those themes. Results of the study suggest that Merger was not as great success as it was described in earlier years. Explanations why merger ended up into demerger vary greatly. From material key factor, lack of, or error in, long term strategic planning was identified. This was due to death in family during strategy creation and mistakes made in pre-merger phase.

Marriage Matching with Correlated Preferences

Authors of experimental, empirical, theoretical and computational studies of two-sided matching markets have recognized the importance of correlated preferences. We develop a general method for the study of the effect of correlation of preferences on the outcomes generated by two-sided matching mechanisms. We then illustrate our method by using it to quantify the effect of correlation of preferences on satisfaction with the men-propose Gale-Shapley matching for a simple one-to-one matching problem.

Marriage Matching and Intercorrelation of Preferences

Men's and women's preferences are intercorrelated to the extent that men rank highly those women who rank them highly. Intercorrelation plays an important but overlooked role in determining outcomes of matching mechanisms. We study via simulation the effect of intercorrelated preferences on men's and women's aggregate satisfaction with the outcome of the Gale-Shapley matching mechanism. We conclude with an application of our results to the student admission matching problem.

Marital counselling: follow-up study of marriage guidance clients: perceptions of the agency, the process and outcomes. Available in 2 volumes.

This study is a consumer-survey conducted with former Marriage Guidance Council clients. The objectives were to identify and examine why they chose the agency, what their expectations and experiences were of marital counselling and whether anything was achieved. The material was derived from tape recorded interviews with 51 former M.G. clients (17 men and 34 women) from 42 marriages and with 21 counsellors; data from written material and a card-sort completed by the research sample; and the case record sheets of the research population (174 cases). The results from the written data of clients showed that 49% were satisfied with counselling, 25.5% were satisfied in some ways but not in others, and 25.5% were dissatisfied. Forty-six percent rated they had benefited from counselling, either a great deal or to some degree, 4% were neutral and 50% recorded they had not benefited. However the counsellors' assessments were more optimistic. It was also ascertained that 50% of the research sample eventually separated or divorced subsequent to counselling. A cross-check revealed that the majority who rated they were satisfied with counselling were those who remained married, whilst dissatisfied clients were the ones who unwillingly separated or divorced. The study then describes, discusses and assesses the experiences of clients in the light of these findings on a number of dimensions. From this it was possible to construct a summary profile of a "successful" client describing the features which would contribute to "success". Two key themes emerged from the data. (1) the discrepancy between clients expectations and the counselling offered, which included mis­ match over the aims and methods of counselling, and problem definition; and (2) the importance of the client/counsellor relationship. The various implications for the agency are then discussed which include recommendations on policy, the training of counsellors and further research.

Fighting child marriage in developing countries: design and development of a mobile application

Child marriage is still a great issue in developing countries and even if the interventions to prevent it are having results, they are not enough to eliminate the problem. Among the strategies that seem to work most to fight child marriage, there is the empowerment of girls with information combined with education of parents and community. As smartphones are more accessible year after year in developing countries, this thesis wants to investigate if a mobile app could be effective in fighting child marriage and which characteristics such an app should have. The research was organized in four phases and used design and creation and case study methodologies. Firstly, the literature was analyzed and an initial design was proposed. Secondly, expert interviews were performed to gain feedback on the proposed design, and afterwards prototype was built. Thirdly, a case study in the Democratic Republic of Congo (DRC) was performed to test the prototype, gaining insights and improvements through group interviews with 26 girls aged 15-19. Finally, a first version of the app was developed and a second phase of the case study was run in the DRC to understand if the girls were able to use the app. This phase included 14 girls of which 6 had participated in the prototype testing and used questionnaires as a data generation method. The app was built following the Principles for Digital Development. Even if this app is built based on the case study in DRC is modular and easily adaptable to other contexts as it is not content-specific. It was shown that is worth continuing to study this topic and it was defined a conceptual framework for designing learning apps for developing countries, in particular, to fight child, early, and forced marriage.

Biased Random-key Genetic Algorithms For The Winner Determination Problem In Combinatorial Auctions.

Abstract In this paper, we address the problem of picking a subset of bids in a general combinatorial auction so as to maximize the overall profit using the first-price model. This winner determination problem assumes that a single bidding round is held to determine both the winners and prices to be paid. We introduce six variants of biased random-key genetic algorithms for this problem. Three of them use a novel initialization technique that makes use of solutions of intermediate linear programming relaxations of an exact mixed integer-linear programming model as initial chromosomes of the population. An experimental evaluation compares the effectiveness of the proposed algorithms with the standard mixed linear integer programming formulation, a specialized exact algorithm, and the best-performing heuristics proposed for this problem. The proposed algorithms are competitive and offer strong results, mainly for large-scale auctions.

Ecological Literacy And Beyond: Problem-based Learning For Future Professionals.

Ecological science contributes to solving a broad range of environmental problems. However, lack of ecological literacy in practice often limits application of this knowledge. In this paper, we highlight a critical but often overlooked demand on ecological literacy: to enable professionals of various careers to apply scientific knowledge when faced with environmental problems. Current university courses on ecology often fail to persuade students that ecological science provides important tools for environmental problem solving. We propose problem-based learning to improve the understanding of ecological science and its usefulness for real-world environmental issues that professionals in careers as diverse as engineering, public health, architecture, social sciences, or management will address. Courses should set clear learning objectives for cognitive skills they expect students to acquire. Thus, professionals in different fields will be enabled to improve environmental decision-making processes and to participate effectively in multidisciplinary work groups charged with tackling environmental issues.

A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over

This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have been proposed to solve it. Nevertheless, few researches explored the multi-plant capacitated lot sizing problem (MPCLSP), which means that few solution methods were proposed to solve it. Furthermore, to our knowledge, no study of the MPCLSP with setup carry-over was found in the literature. This paper presents a mathematical model and a GRASP (Greedy Randomized Adaptive Search Procedure) with path relinking to the MPCLSP with setup carry-over. This solution method is an extension and adaptation of a previously adopted methodology without the setup carry-over. Computational tests showed that the improvement of the setup carry-over is significant in terms of the solution value with a low increase in computational time.