On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Dynamic Strategic Pricing and Speed of Diffusion

Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices.     

Action learning versus strategy learning

This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004     

Improved customer choice predictions using ensemble methods

In this paper various ensemble learning methods from machine learning and statistics are considered and applied to the customer choice modeling problem. The application of ensemble learning usually improves the prediction quality of flexible models like decision trees and thus leads to improved predictions. We give experimental results for two real-life marketing datasets using decision trees, ensemble versions of decision trees and the logistic regression model, which is a standard approach for this problem. The ensemble models are found to improve upon individual decision trees and outperform logistic regression.     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Noninferior Nash Strategies for Multi-Team Systems

This paper is concerned with the optimization of systems that are controlled by several teams of decision makers. The decision makers within each team cooperate for the benefit of their team. On the other hand, the teams compete among themselves in order to achieve an objective that relates to the overall performance of the system. An approach that merges concepts from team theory and game theory for dealing with such systems and a solution called the noninferior Nash strategy are introduced. This multi-team solution provides a new framework for analyzing hierarchically controlled systems so as to address complicated coordination problems among the decision makers. The properties of the noninferior Nash solution in static multi-team systems are investigated and necessary conditions for its existence are derived. Analytical expressions for the noninferior Nash strategies are derived for a class of linear-quadratic static multi-team games. In order to deal with the issue of nonuniqueness of the solution, the concept of a noninferior Nash strategy with a team leader is introduced. Several examples are presented to illustrate the results.     

Sum-fuzzy implementation of a choice function using artificial learning procedure with fixed fraction

In one if his paper Luo transformed the problem of sum-fuzzy rationality into artificial learning procedure and gave an algorithm which used the learning rule of perception. This paper extends the Luo method for finding a sum-fuzzy implementation of a choice function and offers an algorithm based on the artificial learning procedure with fixed fraction. We also present a concrete example which uses this algorithm.     

Generating well-behaved utility functions for compromise programming

The purpose of this paper is to seek utility functions satisfying a weak condition which guarantees that the utility optimum always belongs to the compromise set. This set is a special subset of the attainable or feasible set, which is generated through the application of the well-known operational research approach called compromise programming. It is shown that there are large families of utility functions satisfying this condition, thus reinforcing the value of compromise programming as a good surrogate of the traditional utility optimum.Thanks are due to the reviewers for their helpful suggestions. The English editing by Ms. Christine Méndez is appreciated. The authors have been supported by the Comisión Interministerial de Ciencia y Tecnología (CICYT), Madrid, Spain.     

Tactical problems involving uncertain actions

The purpose of this paper is to solve anm-silent versusn-silent duel with arbitrary accuracy functionsP andQ which are continuously differentiable in [0, 1] with positive derivatives in (0, 1) and such thatP(0)=Q(0)=0,P(1)(0, 1),Q(1)(0, 1). The game can be interpreted as a game in which the players know only that the numbers of their actions have binomial distribution.Part of this paper was written during the author's stay at the Institute of Statistics and Mathematical Economics, University of Karlsruhe, FRG. The author wishes to thank Prof. S. Trybua, Technical University of Wrocaw, Poland, for helpful discussion in preparing the paper and Prof. D. Pallaschke, University of Karlsruhe, FRG, for help in preparing the numerical example.     

Current mass spectrometry strategies for selenium speciation in dietary sources of high-selenium

This document reviews the most relevant mass spectrometry approaches to selenium (Se) speciation in high-Se food supplements in terms of qualitative and quantitative Se speciation and Se-containing species identification, with special reference to high-Se yeast, garlic, onions and Brazil nuts. Important topics such as complexity of Se speciation in these materials and the importance of combining Se-specific detection and molecule-specific determination of the particular species of this element in parallel with chromatography, to understand their nutritional role and cancer preventive properties are critically discussed throughout. The versatility and potential of mass spectrometric detection in this field are clearly demonstrated. Although great advances have been achieved, further developments are required, especially if speciatedcertified reference materials (CRMs) are to be produced for validation of measurements of target Se-containing species in Se-food supplements.