We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with a preference relation such that the observed choices are Pareto efficient. We differentiate between t...

• We allocate objects to agents with edge weights representing welfare judgments. introduce the constrained welfare-maximizing solution. identify conditions under which this solution can be computed in polynomial time. For unrestricted computationally difficult case, we formulate an integer program. The program is viable practice as demonstrate on a real-world problem. exemplified primarily by ...

Tiebout’s basic claim was that when public goods are local, competition between jurisdictions solves the free riding problem in the sense that equilibria exist and are always Pareto efficient. Unfortunately, the literature does not quite support this conjecture. For finite economies, one must choose between notions of Tiebout equilibrium which are Pareto optimal but which may be empty, or which...

Transactions at non-equilibrium prices are “false trades”. Under standard assumptions, markets without false trading produce Pareto-efficient outputs. This paper demonstrates graphically the complications created when false trades occur, showing that quantities produced deviate from Pareto-efficient quantities except under unique conditions. In a general equilibrium framework, this spills over ...

Marketers often stress the importance of treating customers as partners. A fundamental premise of this perspective is that all parties can be weakly better off if they work together to increase joint surplus and reach Pareto-efficient agreements. For marketing managers, this implies organizing marketing activities in a manner that maximizes total surplus. This logic is theoretically sound when ...

The purpose of this paper is to investigate the informational requirements of resource allocation processes for convex production economies. First, we establish a lower bound of the message space of an informationally decentralized mechanism that realizes Pareto efficient allocations over the class of classical production economies. Then, it is shown that this lower bound is exactly the size of...

  We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...

The following MOEA algorithms are briefly summarized and compared: • NPGA Niched Pareto Genetic Algorithm (1994) – NPGA II (2001) • NSGA Non-dominated Sorting Genetic Algorithm (1994) – NSGA II (2000) • SPEA Strength Pareto Evolutionary Algorithm (1998) – SPEA2 (2001) – SPEA2+ (2004) – ISPEA Immunity SPEA (2003) • PAES Pareto Archived Evolution Strategy (2000) – M-PAES Mimetic PAES (2000) • PES...