CONGESTION MODELS AND WEIGHTED BAYESIAN POTENTIAL GAMES

Games associated with congestion situations à la Rosenthal (1973) have pure Nash equilibria. This result implicitly relies on the existence of a potential function. In this paper we provide a characterization of potential games in terms of coordination games and dummy games. Second, we extend Rosenthal's congestion model to an incomplete information setting, and show that the related Bayesian games are potential games and therefore have pure Bayesian equilibria.     

Characterizing QALYs under a General Rank Dependent Utility Model

This paper provides a characterization of QALYs, the most important outcome measure in medical decision making, in the context of a general rank dependent utility model. We show that both for chronic and for nonchronic health states the characterization of QALYs depends on intuitive conditions. This facilitates the assessment of the validity of QALYs in rank dependent non-expected utility theories and a comparison with other utility based measures of health.     

Rawls and Bentham reconciled

The paper deals with the characterization of a class of social welfare orderings. The social evaluation functions which represent these orderings are separable in the components of the ordered utility vector. The characterization is based on the Strong Pareto Property, Co-cardinality, Continuity and a new Independence Property. Since this class encompasses the utilitarian rule and since there are members of this family which almost coincide with the rules of rank dictatorship this family bridges the gap between pure utilitarianism and rank dictatorship.     

Ordinal equivalence of power notions in voting games

In this paper, we are concerned with the preorderings (SS) and (BC) induced in the set of players of a simple game by the Shapley–Shubik and the Banzhaf–Coleman's indices, respectively. Our main result is a generalization of Tomiyama's 1987 result on ordinal power equivalence in simple games; more precisely, we obtain a characterization of the simple games for which the (SS) and the (BC) preorderings coincide with the desirability preordering (T), a concept introduced by Isbell (1958), and recently reconsidered by Taylor (1995): this happens if and only if the game is swap robust, a concept introduced by Taylor and Zwicker (1993). Since any weighted majority game is swap robust, our result is therefore a generalization of Tomiyama's. Other results obtained in this paper say that the desirability relation keeps itself in all the veto-holder extensions of any simple game, and so does the (SS) preordering in all the veto-holder extensions of any swap robust simple game.     

Target Rules for Public Choice Economies on Tree Networks and in Euclidean Spaces

We consider the problem of choosing the location of a public facility either (a) on a tree network or (b) in a Euclidean space. (a) (1996) characterize the class of target rules on a tree network by Pareto efficiency and population-monotonicity. Using Vohra's (1999) characterization of rules that satisfy Pareto efficiency and replacement-domination, we give a short proof of the previous characterization and show that it also holds on the domain of symmetric preferences. (b) The result obtained for model (a) proves to be crucial for the analysis of the problem of choosing the location of a public facility in a Euclidean space. Our main result is the characterization of the class of coordinatewise target rules by unanimity, strategy-proofness, and either replacement-domination or population-monotonicity.     

Nash Bargaining Theory,Nonconvex Problems and Social Welfare Orderings

In this paper we deal with the extension of Nash bargaining theory to nonconvex problems. By focussing on the Social Welfare Ordering associated with a bargaining solution, we characterize the symmetric Nash Bargaining Solution (NBS). Moreover, we obtain a unified method of proof of recent characterization results for the asymmetric single-valued NBS and the symmetric multivalued NBS, as well as their extensions to different domains.     

A tale of two tails: An alternative characterization of comparative risk

A characterization of comparative risk, parallel to but more restrictive than the Rothschild-Stiglitz (1970) characterization, is developed. As in Rothschild and Stiglitz, we develop a four-way characterization that consists of generating processes (a noise condition and generation by a sequence of special mean-preserving spreads), integral conditions, and preferences. The building blocks of this new order, Mean-preserving increases in risk about ν, where ν is any constant, are mean-preserving spreads whose centers have a nonempty intersection. If this intersection contains the mean of the distribution, the induced order, or mean-preserving increase in risk about the mean, conveys a particularly meaningful notion of an increase in risk as a buildup of the tails of the distribution.     

A Model of Minimal Probabilistic Belief Revision

In the literature there are at least two models for probabilistic belief revision: Bayesian updating and imaging [Lewis, D. K. (1973), Counterfactuals, Blackwell, Oxford; Gärdenfors, P. (1988), Knowledge in flux: modeling the dynamics of epistemic states, MIT Press, Cambridge, MA]. In this paper we focus on imaging rules that can be described by the following procedure: (1) Identify every state with some real valued vector of characteristics, and accordingly identify every probabilistic belief with an expected vector of characteristics; (2) For every initial belief and every piece of information, choose the revised belief which is compatible with this information and for which the expected vector of characteristics has minimal Euclidean distance to the expected vector of characteristics of the initial belief. This class of rules thus satisfies an intuitive notion of minimal belief revision. The main result in this paper is to provide an axiomatic characterization of this class of imaging rules.     

Choices Under Ambiguity With Familiar And Unfamiliar Outcomes

This paper considers a decision-making process under ambiguity in which the decision-maker is supposed to split outcomes between familiar and unfamiliar ones. She is assumed to behave differently with respect to unfamiliar gains, unfamiliar losses and customary (familiar) outcomes. In particular, she is supposed to be pessimistic on gains, optimistic on losses and ambiguity neutral on the familiar outcomes. A generalization of the usual Choquet Integral is formalized when the decision maker holds capacities and probabilities. A characterization of the decision-maker’s behavior is provided for a specific subset of capacities, in which it is shown that the decision-maker underestimates the unfamiliar outcomes while is linear in probabilities on customary ones.     

A note on Savage's theorem with a finite number of states

This article gives a preference-based characterization of subjective expected utility for the general equilibrium model with a finite number of states. The characterization follows Savage (1954) as closely as possible but has to abandon his axiom (P6), atomlessness of events, since this requires an infinite state space. To introduce continuity we replace (P6) with a continuity assumption on the set of consequences and assume the preferences are smooth. Then we apply Savage's sure-thing principle and his state-independence axiom to get an additively separable utility representation. Finally, to separate subjective probabilities from basic tastes, we apply a new axiom, which states that for each pair of states the marginal rate of substitution is constant along the certainty line.     

Differential marginality,van den Brink fairness,and the Shapley value

We revisit the characterization of the Shapley value by van den Brink (Int J Game Theory, 2001, 30:309–319) via efficiency, the Null player axiom, and some fairness axiom. In particular, we show that this characterization also works within certain classes of TU games, including the classes of superadditive and of convex games. Further, we advocate some differential version of the marginality axiom (Young, Int J Game Theory, 1985, 14: 65–72), which turns out to be equivalent to the van den Brink fairness axiom on large classes of games.     

Moslem Arab Portrayal in the Australian Press and in School Textbooks

This paper surveys the overall characterization of Moslem Arabs and their culture as reflected by the press and in social science textbooks. Four widely circulated Melbourne newspapers and 15 of the most commonly used social science school textbooks formed the basis of content analysis. It has been found that the portrayal of Moslem Arabs was predominantly negative, involving overstatements, baseless charges and evaluative perceptions.     

Preferences Representable by a Lower Expectation: Some Characterizations

We propose two different characterizations for preference relations representable by lower (upper) expectations with the aim of removing either fair price or completeness requirements. Moreover, we give an explicit characterization for comparative degrees of belief on a finite algebra of events representable by lower probabilities.     

A characterization of the maximin rule in the context of voting

In a voting context, when the preferences of voters are described by linear orderings over a finite set of alternatives, the Maximin rule orders the alternatives according to their minimal rank in the voters’ preferences. It is equivalent to the Fallback bargaining process described by Brams and Kilgour (Group Decision and Negotiation 10:287–316, 2001). This article proposes a characterization of the Maximin rule as a social welfare function (SWF) based upon five conditions: Neutrality, Duplication, Unanimity, Top Invariance, and Weak Separability. In a similar way, we obtain a characterization for the Maximax SWF by using Bottom Invariance instead of Top Invariance. Then, these results are compared to the axiomatic characterizations of two famous scoring rules, the Plurality rule and the Antiplurality rule.     

近十年中国学界大江健三郎小说研究综述

荣获诺贝尔文学奖后,大江健三郎很快成为中国文学研究界关注的焦点。从获奖后的1995年到2004年上半年,10年间全国共发表各类研究论文87篇。这些论文探讨了有关大江健三郎及其创作的方方面面,诸如大江小说的精神内涵和创作意识,大江小说中的人物形象,大江小说的艺术成就和文体特点以及大江与其他作家作品的比较研究等等。     

Binary Relations: Finite Characterizations and Computational Complexity

A characterization of a property of binary relations is of finite type if it is stated in terms of ordered T-tuples of alternatives for some positive integer T. The concept was introduced informally by Knoblauch (2005). We give a clear, complete definition below. We prove that a characterization of finite type can be used to determine in polynomial time whether a binary relation over a finite set has the property characterized. We also prove a simple but useful nonexistence theorem and apply it to three examples.      

A characterization of majority voting rules with quorums

We give a characterization of majority voting rules with quorums in the framework of May (Econometrica 20:680–684, 1952)’s seminal article. According to these voting rules, an alternative is socially chosen if and only if it obtains the relative majority of votes and the total number of voters not abstaining reaches the quorum.     

Preference extension rules for ranking sets of alternatives with a fixed cardinality

This paper analyzes the problem of deriving a ranking of fixed-cardinality subsets of a universal set from a given ranking of the elements of this universal set. Only subsets with a given number of elements are being ranked, which is where the approach in this paper differs from the literature on extension rules that establish preference relations on the power set of the universal set. Common examples for areas where such preferences on subsets with a fixed cardinality are needed are elections of committees of a given size, many-to-one matchings, and decision problems under ignorance. The main result of the paper is a characterization of a class oflexicographic rank-ordered rules by means of two axioms, namely, aresponsiveness condition used in the matching literature and a well-knownneutrality requirement which ensures that the names of the alternatives are irrelevant for the ranking of the sets.     

Mechanism robustness in multilateral bargaining

This paper discusses the relationship between coalitional stability and the robustness of bargaining outcomes to the bargaining procedure. We consider a class of bargaining procedures described by extensive form games, where payoff opportunities are given by a characteristic function (cooperative) game. The extensive form games differ on the probability distribution assigned to chance moves which determine the order in which players take actions. One way to define mechanism robustness is in terms of the property of no first mover advantage. An equilibrium is mechanism robust if for each member the expected payoff before and after being called to propose is the same. Alternatively one can define mechanism robustness as a property of equilibrium outcomes. An outcome is said to be mechanism robust if it is supported by some equilibrium in all the extensive form games (mechanisms) within our class. We show that both definitions of mechanism robustness provide an interesting characterization of the core of the underlying cooperative game.     

On the Inconsistency of Equilibrium Refinement

Consistency and optimality together with converse consistency provide an illuminating and novel characterization of the equilibrium concept (Peleg and Tijs, 1996). But (together with non-emptiness) they preclude refinements of the equilibrium notion and selection of a unique equilibrium (Norde et al., 1996). We suggest two escape routes: By generalizing the concept of strict equilibrium we question the practical relevance of the existence requirement for refinements. To allow for equilibrium selection we suggest more complex reduced games which capture the inclinations of ``players who already left'.