This paper investigates the informational requirements of resource allocation processes in public goods economies with any number of firms and commodities. We show that the Lindahl mechanism is informationally efficient in the sense that it uses the smallest message space among smooth resource allocation processes that are informationally decentralized and realize Pareto optimal allocations ove...

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...

The Pareto-Nash equilibrium set (PNES) is described as intersection of graphs of efficient response mappings. The problem of PNES computing in finite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing is studied. Mathematics Subject Classification 2010: 91A05, 91A06, 91A10, 91A43, 91A44.

Many practical optimization problems usually have several conflicting objectives. In those multi-objective optimization, no solution optimizing all objective functions simultaneously exists in general. Instead, Pareto optimal solutions, which are “efficient” in terms of all objective functions, are introduced. In general we have many Pareto optimal solutions. Therefore, we need to decide a fina...

In multidisciplinary optimization a designer solves a problem where there are different criteria usually contradicting each other. In general, the solution of such a problem is not unique. When seeking an optimal design, it is natural to exclude from the consideration any design solution which can be improved without deterioration of any discipline and violation of the constraints; in other wor...

We obtain sufficient and/or necessary conditions for global/local error bounds for the distances to some sets appeared in set optimization studied with both the set approach and vector approach (sublevel sets, constraint sets, sets of all Pareto efficient/ Henig proper efficient/super efficient solutions, sets of solutions corresponding to one Pareto efficient/Henig proper efficient/super effic...

This paper studies the design of a strategy-proof resource allocation rule in economies with perfectly divisible multiple commodities and single-peaked preferences. It is known that the uniform rule is the unique allocation rule satisfying strategy-proofness, Pareto efficiency, and anonymity if the number of commodity is only one and preferences are single-peaked (Sprumont (1991)). However, if ...

In this article, we consider the novel approach of a seller and customer negotiating bilaterally about a two-part tariff, using autonomous software agents. An advantage of this approach is that win–win opportunities can be generated while keeping the problem of preference elicitation as simple as possible. We develop bargaining strategies that software agents can use to conduct the actual bilat...

Complex distribution networks are pervasive in biology. Examples include nutrient transport in the slime mold Physarum polycephalum as well as mammalian and plant venation. Adaptive rules are believed to guide development of these networks and lead to a reticulate, hierarchically nested topology that is both efficient and resilient against perturbations. However, as of yet no mechanism is known...

Pareto optimization solves a constrained optimization task by reformulating the task as a bi-objective problem. Pareto optimization has been shown quite effective in applications; however, it has little theoretical support. This work theoretically compares Pareto optimization with a penalty approach, which is a common method transforming a constrained optimization into an unconstrained optimiza...