A note on nondictatorial conditions for choice mechanisms

It is demonstrated that weakening the strong nondictatorship requirement stated by Gibbard and by Satterthwaite enables the construction of strategy-proof choice mechanisms by shifting the difficulties from the phase of choice mechanism construction to the phase of agenda formation.     

Quasi-metrics and monotone normality

The purpose of this paper is to study which quasi-metrizable spaces are monotonically normal. In particular, we provide a sufficient condition for a quasi-metrizable space to be monotonically normal. This enables us to prove the monotone normality of a certain amount of interesting examples of quasi-metric spaces; for instance, we show that the continuous poset of formal balls of a metric space, endowed with the Scott topology, is a monotonically normal quasi-metrizable space.     

Resolvability and monotone normality

A space X is said to be κ-resolvable (resp., almost κ-resolvable) if it contains κ dense sets that are pairwise disjoint (resp., almost disjoint over the ideal of nowhere dense subsets). X is maximally resolvable if and only if it is Δ(X)-resolvable, where Δ(X) = min{|G| : G ≠ open}. We show that every crowded monotonically normal (in short: MN) space is ω-resolvable and almost μ-resolvable, where μ = min{2 ^ω , ω ₂}. On the other hand, if κ is a measurable cardinal then there is a MN space X with Δ(X) = κ such that no subspace of X is ω ₁-resolvable. Any MN space of cardinality < ℵ _ω is maximally resolvable. But from a supercompact cardinal we obtain the consistency of the existence of a MN space X with |X| = Δ(X) = ℵ _ω such that no subspace of X is ω ₂-resolvable. The preparation of this paper was supported by OTKA grant no. 61600     

A descent algorithm for solving monotone variational inequalities and monotone complementarity problems

The paper provides a descent algorithm for solving certain monotone variational inequalities and shows how this algorithm may be used for solving certain monotone complementarity problems. Convergence is proved under natural monotonicity and smoothness conditions; neither symmetry nor strict monotonicity is required.The author is grateful to two anonymous referees for their very valuable comments on an earlier draft of this paper.     

New monotone hybrid algorithm for hemi-relatively nonexpansive mappings and maximal monotone operators

The purpose of this article is to prove the strong convergence theorems for hemi-relatively nonexpansive mappings in Banach spaces. In order to get the strong convergence theorems for hemi-relatively nonexpansive mappings, a new monotone hybrid iteration algorithm is presented and is used to approximate the fixed point of hemi-relatively nonexpansive mappings. Noting that, the general hybrid iteration algorithm can be used for relatively nonexpansive mappings but it can not be used for hemi-relatively nonexpansive mappings. However, this new monotone hybrid algorithm can be used for hemi-relatively nonexpansive mappings. In addition, a new method of proof has been used in this article. That is, by using this new monotone hybrid algorithm, we firstly claim that, the iterative sequence is a Cauchy sequence. The results of this paper modify and improve the results of Matsushita and Takahashi, and some others.     

A monotone version of the Sokolov property and monotone retractability in function spaces

We introduce the monotone Sokolov property and show that it is dual to monotone retractability in the sense that X   is monotonically retractable if and only if _Cp(X)$C_p(X)$ is monotonically Sokolov. Besides, a space X   is monotonically Sokolov if and only if _Cp(X)$C_p(X)$ is monotonically retractable. Monotone retractability and monotone Sokolov property are shown to be preserved by R$\mathbb{R}$-quotient images and _Fσ$F_{\sigma }$-subspaces. Furthermore, every monotonically retractable space is Sokolov so it is collectionwise normal and has countable extent. We also establish that if X   and _Cp(X)$C_p(X)$ are Lindelöf Σ-spaces then they are both monotonically retractable and have the monotone Sokolov property. An example is given of a space X   such that _Cp(X)$C_p(X)$ has the Lindelöf Σ-property but neither X   nor _Cp(X)$C_p(X)$ is monotonically retractable. We also establish that every Lindelöf Σ-space with a unique non-isolated point is monotonically retractable. On the other hand, each Lindelöf space with a unique non-isolated point is monotonically Sokolov.     

Isometries on and monotone functions

We study necessary and sufficient conditions on a bounded operator T defined on the Hilbert space to be an isometry and show that, under suitable hypotheses, it suffices to restrict T to a smaller class of functions (e.g., if , to the cone of positive and decreasing functions). We also consider the problem of characterizing the sets for which the orthogonal projection of the operator T on is also an isometry. Finally, we illustrate our results with several examples involving classical operators on different settings.     

Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations

Monotone linear relations play important roles in variational inequality problems and quadratic optimizations. In this paper, we give explicit maximally monotone linear subspace extensions of a monotone linear relation in finite dimensional spaces. Examples are provided to illustrate our extensions. Our results generalize a recent result by Crouzeix and Ocaña-Anaya.     

On the equivalence of the Boston and top trading cycles school choice mechanisms

This paper shows that the Boston and top trading cycles school choice mechanisms are equivalent if, and only if, the priority structure is both strongly acyclic and Kesten-acyclic.     

Braids and their monotone clones

In this paper we investigate properties of the monotone clones of certain ordered sets known asbraids. This class of ordered sets arose naturally in the study of how the clone of monotone functions on an ordered set could satisfy, or fail to satisfy, Mal'cev conditions. One version of the main result can be stated as follows. IfB is a finite braid with reachr(B)>2 (defined in the text), then the only idempotent order-preserving functionsfBⁿB are then projections. It then follows, for example, that no algebra of monotone functions on a finite braidB withr(B)>2 generates a congruence-modular variety.Dedicated to Bjarni Jónsson on the occasion of his 70th birthday.Presented by G. McNulty.This research was supported by ARC grant A68831070 (Davey) and in part by NSF grant 87-03540 (Nation) and 89-04014 (McKenzie).     

On monotone and quasicompact mappings

In this paper, some properties of monotone mappings and quasi-compact mappings have been studied.     

Refinable and monotone maps revisited

Generalizing results by J. Ford, J. W. Rogers, Jr. and H. Kato we prove that (1) a map f from a G-like continuum onto a graph G is refinable iff f is monotone; (2) a graph G is an arc or a simple closed curve iff every G-like continuum that contains no nonboundary indecomposable subcontinuum admits a monotone map onto G.We prove that if bonding maps in the inverse sequence of compact spaces are refinable then the projections of the inverse limit onto factor spaces are refinable. We use this fact to show that refinable maps do not preserve completely regular or totally regular continua.     

Monotone and maximal monotone affine subspaces

Affine monotone and maximal monotone subspaces are characterized.