Between Pareto efficiency and Pareto ε-efficiency

By using an efficiency notion placed between Pareto efficiency and Pareto ε-efficiency it is shown that semi Archimedian ordered vector spaces and regular ordered locally convex spaces can be characterized by existence results concerning efficient points of this type for lower bounded sets. The technique developed in the paper allows us to obtain necessary and sufficient conditions for the existence of Pareto efficient points, too.     

Reducing the feasible region to a scheduling problem

A special class of scheduling problems is considered. We consider cycle-free sets of fronts correspond to the orderings of a network. If the project is recourse-constrained, the same cycle-free set of fronts can correspond to different orderings. Some cycle-free sets of fronts can be subsets of others. The goal of the paper is to characterize maximal cycle-free sets of fronts because only those are essential for obtaining an optimal schedule.     

Social choice theory without Pareto: The pivotal voter approach

This paper extends the pivotal voter approach pioneered by Barberá [Barberá, S., 1980. Pivotal voters: A new proof of Arrow’s Theorem. Economics Letters 6, 13–6; Barberá, S., 1983. Strategy-proofness and pivotal voters: A direct proof of the Gibbard-Satterthwaite Theorem. International Economic Review 24, 413–7] to all social welfare functions satisfying independence of irrelevant alternatives. Arrow’s Theorem, Wilson’s Theorem, and the Muller–Satterthwaite Theorem are all immediate corollaries of the main result. It is further shown that a vanishingly small fraction of pairs of alternatives can be affected in the group preference ordering by multiple individuals, which generalizes each of the above theorems.     

Some properties of choice functions based on valued binary relations

Choice functions based on t-norms of valued binary relations are introduced. Strict preference is also specified with the use of a t-norm. Properties of the choice functions are investigated and rationality conditions are studied. Some classical particular cases are presented.     

Further results on pinnacle sets

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis, Nelson, Petersen, and Tenner and also results proven recently by Fang, this paper aims to add to our understanding of pinnacle sets by giving a simpler and more combinatorial proof of a weighted sum formula previously proven by Fang.     

Propositional distances and compact preference representation

Distances between possible worlds play an important role in logic-based knowledge representation (especially in belief change, reasoning about action, belief merging and similarity-based reasoning). We show here how they can be used for representing in a compact and intuitive way the preference profile of an agent, following the principle that given a goal G, then the closer a world w to a model of G, the better w. We give an integrated logical framework for preference representation which handles weighted goals and distances to goals in a uniform way. Then we argue that the widely used Hamming distance (which merely counts the number of propositional symbols assigned a different value by two worlds) is generally too rudimentary and too syntax-sensitive to be suitable in real applications; therefore, we propose a new family of distances, based on Choquet integrals, in which the Hamming distance has a position very similar to that of the arithmetic mean in the class of Choquet integrals.     

Properties of game options

A game option is an American option with the added feature that not only the option holder, but also the option writer, can exercise the option at any time. We characterize the value of a perpetual game option in terms of excessive functions, and we use the connection between excessive functions and concave functions to explicitly determine the value in some examples. Moreover, a condition on the two contract functions is provided under which the value is convex in the underlying diffusion value in the continuation region and increasing in the diffusion coefficient.Mathematics Subject Classification (2000) Primary 91A15, Secondary 60G40, 91B28     

区间二次规划在确定模糊评价因素权向量中的应用

利用区间二次规划方法确定模糊综合评判中评价因素的模糊权向量，它的原理是：以区间的概念为基础。利用区问相离度公式计算使主观偏好值与客观偏好值的总差距最小的权向量就是所求的评价因素的模糊权向量。     

Block Orderings for Tensor-Product Grids in Two and Three Dimensions

We consider two-line and two-plane orderings for a convection–diffusion model problem in two and three dimensions, respectively. These strategies are aimed at introducing dense diagonal blocks, at the price of a slight increase of the bandwidth of the matrix, compared to natural lexicographic ordering. Comprehensive convergence analysis is performed for the block Jacobi scheme. We then move to consider a two-step preconditioning technique, and analyze the numerical properties of the linear systems that are solved in each step of the iterative process. For the 3-dimensional problem this approach is a viable alternative to the Incomplete LU approach, and may be easier to implement in parallel environments. The analysis is illustrated and validated by numerical examples.