Stochastic demand correspondences and their aggregation properties

Bandyopadhyay, Dasgupta and Pattanaik [JET, 2002] have presented a construction that aggregates standard demand functions by a stochastic demand function, in such way that the latter satisfies the weak axiom of stochastic revealed preference when the former fulfil Samuelson's weak axiom of revealed preference. We introduce a concept of stochastic demand correspondences and generalize WASRP to this new setting. Also, we propose a procedure to aggregate stochastic demand correspondences that (a) includes the previous one by those authors, (b) aggregates the weak axiom of stochastic revealed preference (and thus stochastic substitutability when we started with tight stochastic demand functions), and (c) produces a stochastically rational stochastic demand correspondence when the primitive ones are stochastically rational. Interpretations of the model are provided too. An analogous to the result that rationalizability of stochastic demand functions by stochastic orderings implies WASRP holds for the correspondence setting. We also discuss the convenience of adopting a formal variation of the notion of being stochastically rational that was proposed in the literature.Weak Axiom of Stochastic Revealed Preference; Weak Axiom of Revealed Preference; representative consumer; stochastic demand aggregation.

Maximality with or without binariness: transfer-type characterizations

We provide the first necessary and su±cient conditions in the literature for the existence of maximal elements in a non-binary choice framework. As an application, the characterization of the existence of maximal elements for acyclic binary relations obtained in Rodriguez-Palmero and Garcia-Lapresta, 2002, Mathematical Social Sciences 43, 55-60, is deduced as a Corollary. Further characterizations in di®erent settings given by Tian and Zhou, 1995, Journal of Mathematical Economics 24, 281- 303, follow as well. Analogous characterization problems in the k- acyclic binary cases are solved too.maximization; non-binary choice function; transfer-continuity; k-acyclicity

Stochastic demand correspondences and their aggregation properties

Bandyopadhyay, Dasgupta and Pattanaik [JET, 2002] have presented a construction that aggregates standard demand functions by a stochastic demand function, in such way that the latter satisfies the weak axiom of stochastic revealed preference when the former full Samuelson's weak axiom of revealed preference. We introduce a concept of stochastic demand correspondences and generalize WASRP to this new setting. Also, we propose a procedure to aggregate stochastic demand correspondences that (a) includes the previous one by those authors, (b) aggregates the weak axiom of stochastic revealed preference (and thus stochastic substitutability when we started with tight stochastic demand func- tions), and (c) produces a stochastically rational stochastic demand correspondence when the primitive ones are stochastically rational. Interpretations of the model are provided too. An analogous to the result that rationalizability of stochastic demand functions by stochastic orderings implies WASRP holds for the correspondence setting. We also dis- cuss the convenience of adopting a formal variation of the notion of being stochastically rational that was proposed in the literature.

Choice-Nash Equilibria

We provide existence results for equilibria of games where players employ abstract (non binary) choice rules. Such results are shown to encompass as a relevant instance that of games where players have (non-transitive) SSB (Skew-Symmetric Bilinear) preferences, as will as other well-known transitive (e. g. Nash´s) and non-transitive (e. g. Shafer and Sonnenschein´s) models in the literature. Further, our general model contains games where players display procedural rationality.

Topological properties of spaces ordered by preferences

In this paper, we analyze the main topological properties of a relevant class of topologies associated with spaces ordered by preferences (asymmetric, negatively transitive binary relations). This class consists of certain continuous topologies which include the order topology. The concept of saturated identification is introduced in order to provide a natural proof of the fact that all these spaces possess topological properties analogous to those of linearly ordered topological spaces, inter alia monotone and hereditary normality, and complete regularity

The relationship between Mathematical Utility Theory and the Integrability Problem: some arguments in favour

The resort to utility-theoretical issues will permit us to propose a constructive procedure for deriving a homogeneous of degree one, continuous function that gives raise to a primitive demand function under suitably mild conditions. This constitutes the first elementary proof of a necessary and sufficient condition for an integrability problem to have a solution by continuous (subjective utility) functions. Such achievement reinforces the relevance of a technique that was succesfully formalized in Alcantud and Rodríguez-Palmero (2001). The analysis of these two works exposes deep relationships between two apparently separate fields: mathematical utility theory and the revealed preference approach to the integrability problem.Strong Axiom of Homothetic Revelation; revealed preference; continuous homogeneous of degree one utility; integrability of demand.

VHDL-AMS modeling of self-organizing neural systems

This paper presents VHDL-AMS models and simulation results for a complex, self-organizing neural system based on the adaptive resonance theory. Such neural systems exhibit both discrete and continuous dynamic behavior and consist of a large number of analog equations, a digital controller with analog and digital feedback paths resulting in the complexity that would prohibit analysis with conventional mixed-signal simulation tools

Scores of hesitant fuzzy elements revisited: “Was sind und was sollen”

[EN] This paper revolves around the notion of score for hesitant fuzzy elements, the constituent parts of hesitant fuzzy sets. Scores allow us to reduce the level of uncertainty of hesitant fuzzy sets to classical fuzzy sets, or to rank alternatives characterized by hesitant fuzzy information. We propose a rigorous and normative definition capable of encapsulating the characteristics of the most important scores introduced in the literature. We systematically analyse different types of scores, with a focus on coherence properties based on cardinality and monotonicity. The hesitant fuzzy elements considered in this analysis are unrestricted. The inspection of the infinite case is especially novel. In particular, special attention will be paid to the analysis of hesitant fuzzy elements that are intervals

Mathematical utility theory and the representability of demand by continuous homogeneous functions

The resort to utility-theoretical issues will permit us to propose a constructive procedure for deriving a homogeneous of degree one continuous function that gives raise to a primitive demand function under suitably mild conditions. This constitutes the first self-contained and elementary proof of a necessary and sufficient condition for an integrability problem to have a solution by continuous (subjective utility) functions