Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, do require the specification of a global similarity measure which is typically expressed as an aggregation of local measures pertaining to different aspects of a case. Since the proper aggregation of local measures is often quite difficult, we propose a novel concept called similarity skyline...

A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented – the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems. Nash equilibrium (NE) rarely ensures maximal payoff and it is frequently Pareto inefficient. The Pareto set is usually a large set of solutions, often too ha...

Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different solution concepts with different objectives. One of the most important and well-studied ones is that of stability, proposed by Gale and Shapley [8], which captures fairness condition in a model where every individual i...

We develop a novel auction-based algorithm to allow users to fairly compete for a wireless fading channel. We use the second-price auction mechanism whereby user bids for the channel, during each time-slot, based on the fade state of the channel, and the user that makes the higher bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited bud...

Fair division methods offer guarantees to agents of the proportional size or quality of their share in a division of a resource (cake). These guarantees come with a price. Standard fair division methods (or “cake cutting” algorithms) do not find efficient allocations (not Pareto optimal). The lack of efficiency of these methods makes them less attractive for solving multi-agent resource and tas...

This paper investigates the role of fairness, uncertainty, and a "veil of ignorance" in efficient resource allocation. It focuses on the choice of private and public goods, the method of financing, as well as the choice of information available for public decision-making. A fair-equivalent and Pareto efficient allocation is presented using a maximin criterion defined in terms of individual will...

In this paper I consider the problem of determining an equitable allocation of resources in production economies in which factors must be dedicated to production. That is, although they might be used to produce various consumption goods, they cannot be consumed directly. I …rst establish that in such economies, envy-free and e¢ cient allocations exist under standard assumptions, whereas that is...

A fundamental resource allocation setting is the random assignment problem in which agents express preferences over objects that are then randomly allocated to the agents. In 2001, Bogomolnaia and Moulin presented the probabilistic serial (PS) mechanism that is an anonymous, neutral, Pareto optimal, and weak strategyproof mechanism when the preferences are considered with respect to stochastic ...

We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in coloring the graph has associated cost. In this multiagent graph coloring scenario, we seek a minimum legal coloring of the global graph’s vertices, such that the coloring is also Pareto efficient, socially fair, and indiv...