I propose a general collective decision problem consisting in many issues that are interconnected in two ways: by mutual constraints and by connections of relevance. Aggregate decisions should respect the mutual constraints, and be based on relevant information only. This general informational...

In this paper we study three different types of loss aversion equilibria in bimatrix games. Loss aversion equilibria are Nash equilibria of games where players are loss averse and where the reference points – points below which they consider payoffs to be losses – are endogenous to the...

In solving judgment aggregation problems, groups often face constraints. Many decision problems can be modelled in terms the acceptance or rejection of certain propositions in a language, and constraints as propositions that the decisions should be consistent with. For example, court judgments...

This paper lays down conceptual groundwork for optimal choice of a decision maker facing afinite-state Markov decision problem on an infinite horizon. We distinguish two notions of astrategy being favored on the limit of horizons, and examine the properties of the emerging binaryrelations. After...

The standard rational choice paradigm explains an individual’s preferences by his beliefs and his fundamental desires. For instance, someone’s preference for joining the army might be explained by certain beliefs about what life in the army is like and a desire for such a life. While beliefs...

Domains of individual preferences for which the well-known impossibility theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. To comprehend the limitations these results imply for social choice rules, we search for the largest domains that are possible. Here, we...

In spatial environments we consider social welfare functions satisfying Arrow''s requirements, i.e. weak Pareto and independence of irrelevant alternatives. Individual preferences measure distances between alternatives according to the Lp-norm (for a fixed p 1). When the policy space is...

Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...

In this paper we provide a framework to reason about limited awareness of the action space in finitely repeated games. Our framework is rich enough to capture the full strategic aspect of limited awareness in a dynamic setting, taking into account the possibility that agents might want to reveal...

In this paper we show how to compute a daily VaR measure for two stock indexes (CAC40 and SP500) using the one-day-ahead forecast of the daily realized volatility. The daily re-alized volatility is equal to the sum of the squared intraday returns over a given day and thus uses intraday...