The problem of the development of the state information stimulation system of Russian citizens’ socio-optimal actions is considered according to the optimum of collective utility function as criterion. Conceptual model of the system is formed according to the conditions of individual rationality, Pareto efficiency, nonmanipulability and dynamic quasi-optimality. The algorithms of the informatio...

For classical marriage markets with equal numbers of men and women and where all men find all women acceptable and all women find all men acceptable, Sasaki and Toda (1992) characterized the core by same-side anonymity for marriage markets, Pareto optimality, consistency, and converse consistency. Nizamogullari and Özkal-Sanver (2014) generalized this result to the domain of classical marriage ...

A distributed Pareto optimal control problem for an infinite order parabolic system is considered. The performance index has a vector form with two components in integral form. Constraints on controls and on states are imposed. To obtain optimality conditions for the Neumann problem, the generalization of the Dubovitskii–Milyutin theorem was applied. © 2014 The Authors. Production and hosting b...

In this paper we present a novel method for finding the strong Nash equilibrium. The approach consists on determining a scalar λ∗ and the corresponding strategies d∗(λ∗) fixing specific bounds (min and max) that belong to the Pareto front. Bounds correspond to restrictions imposed by the player over the Pareto front that establish a specific decision area where the strategies can be selected. W...

53 notions has significance as an alternative method to value-based decisions. In fact, compared to value-based approaches, reason-based approaches have attractive features that they give the way we normally think and talk about choices, the way suited to handle complex and real world decisions, and the way to understand the conflict characterizing the making of decisions, although it has disad...

In this article, we propose a multiple objective optimization based approach for the short term scheduling of batch plants to select superior solutions when compared to the single objective problem. Two alternate approaches to optimality, viz. lexicographic and pareto-optimality based formulations are considered here. We demonstrate the suitability of lexicographic optimization for the case whe...

Rubinstein, Safra and Thomson (1992) introduced the Ordinal Nash Bargaining Solution. They prove that Pareto optimality, ordinal invariance, ordinal symmetry, and IIA characterize this solution. A feature of their work is that attention is restricted to a domain of social choice problems with an infinite set of basic allocations. We introduce an alternative approach to solving finite social cho...

A big open question of algorithmic information theory is the choice of the universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff induction we have invariance theorems: the choice of the UTM changes bounds only by a constant. For the universally intelligent agent AIXI (Hutter, 2005) no invariance theorem is known. Our results are entirely negative: we discuss cases in which un...

The portfolio selection problem (PSP) uses mathematical approaches to model stock exchange investments. Its aim is to find an optimal set of assets to invest on, as well as the optimal investments for each asset. In this paper, a portfolio selection problem (FPSP) with fuzzy objective function coefficient (FPSP) a multiple objective problem including uncertainties is investigated. The FPSP is c...

In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose a hybrid algorithm based on branch and bound method and Pareto-algebraic operations. The algorithm starts by an initial solution and then combines one-by-one groups of the problem instance to generate partial solutions in each iteration. Most of these partial solutions are discarded by Paret...