In two-sided matching markets, the concept of stability proposed by Gale and Shapley (1962) is one of the most important solution concepts. In this paper, we consider a problem related to the stability of a matching in a two-sided matching market with indifferences (i.e., ties). The introduction of ties into preference lists dramatically changes the properties of stable matchings. For example, ...

In this paper we propose the multi-objective contextual bandit problem with similarity information. This problem extends the classical contextual bandit problem with similarity information by introducing multiple and possibly conflicting objectives. Since the best arm in each objective can be different given the context, learning the best arm based on a single objective can jeopardize the rewar...

To reduce adverse impact potential and improve diversity outcomes from personnel selection, one promising technique is De Corte, Lievens, and Sackett's (2007) Pareto-optimal weighting strategy. De Corte et al.'s strategy has been demonstrated on (a) a composite of cognitive and noncognitive (e.g., personality) tests (De Corte, Lievens, & Sackett, 2008) and (b) a composite of specific cognitive ...

Pareto local search (PLS) methods are local search algorithms for multiobjective combinatorial optimization problems based on the Pareto dominance criterion. PLS explores the Pareto neighbourhood of a set of non-dominated solutions until it reaches a local optimal Pareto front. In this paper, we discuss and analyse three different Pareto neighbourhood exploration strategies: best, first, and ne...

We consider a two-user multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream is transmitted and each receiver applies the minimum mean square error (MMSE) filter. In this paper, we study an open topic on the Pareto boundary of the rate region. The Pareto boundary is divided by two turning points into the weak Pareto boundary (including the horizontal part a...

©James Huang All rights reserved. Short sections of text, not to exceed two paragraphs, may be quoted without explicit permission, provided that full acknowledgement is given. We derive necessary and sufficient conditions for a Pareto optimal sharing rule to be linear in wealth and for all Pareto optimal sharing rules to be linear in wealth. We also show that when agents' beliefs have a particu...

A self-adaptive Pareto Evolutionary Multiobjective Optimization (EMO) algorithm based on differential evolution is proposed for evolving locomotion controllers in an artificially embodied legged creature. The objective of this paper is to demonstrate the trade-off between quality of solutions and computational cost. We show empirically that evolving controllers using the proposed algorithm incu...

Most of the two-sided matching literature maintains the assumption that agents are never indifferent between any two members of the opposite side. In practice, however, ties in preferences arise naturally and are widespread. Market design needs to handle ties carefully, because in the presence of indifferences, stability no longer implies Pareto efficiency, and the deferred acceptance algorithm...

| Many, if not most, optimization problems have multiple objectives. Historically , multiple objectives have been combined ad hoc to form a scalar objective function , usually through a linear combination (weighted sum) of the multiple attributes, or by turning objectives into constraints. The genetic algorithm (GA), however, is readily modiied to deal with multiple objectives by incorporating ...

 Evolutionary multi-objective optimization (EMOO) finds a set of Pareto solutions rather than any single aggregated optimal solution for a multi-objective problem. The purpose of this paper is to describe a newly developed evolutionary approach --Paretobased multi-objective differential evolution (MODE). In this paper, the concept of differential evolution, which is well-known in the continuou...