Building Voters: Exploring Interdependent Preferences in Binary Contexts

In this thesis we develop a new method for constructing binary preference orders for given interdependent structures, called characters. We introduce the preference space, which is a vector space of preference vectors. The preference vectors correspond to binary preference orders. We show that the hyperoctahedral group, Z2 o Sn, describes the symmetries of binary preferences orders and then define an action of Z2 o Sn on our preference vectors. We find a natural basis for a preference space. These basis vectors are indexed by subsets of proposals. We show that when completely separable binary preference vectors are decomposed using this basis, basis vectors indexed by nontrivial, even sized subsets do not appear in the decomposition. We then use these basis vectors as building blocks for preference construction. In particular, we construct preference orders whose Hasse diagram of separable sets have a tree structure

Customer Trading in the Foreign Exchange Market: Empirical Evidence from an Internet Trading Platform

This paper analyzes the relationship between currency price changes and their expectations. Currency price change expectations are derived with the help of different order flow measures, from the trading behavior of investors on OANDA FXTrade, which is an internet trading platform in the foreign exchange market. We investigate whether forecasts of intra-day price changes on different sampling frequencies can be improved with the information contained in the flow of our investors’ orders. Moreover, we verify several hypotheses on the trading behavior and the preference structure of our investors by investigating how past price changes affect future order flow.Customer Dataset, Order Flow, Price Changes, Foreign Exchange Market

Strategy-proof tie-breaking

We study a general class of priority-based allocation problems with weak priority orders and identify conditions under which there exists a strategy-proof mechanism which always chooses an agent-optimal stable, or constrained efficient, matching. A priority structure for which these two requirements are compatible is called solvable. For the general class of priority-based allocation problems with weak priority orders,we introduce three simple necessary conditions on the priority structure. We show that these conditions completely characterize solvable environments within the class of indifferences at the bottom (IB) environments, where ties occur only at the bottom of the priority structure. This generalizes and unifies previously known results on solvable and unsolvable environments established in school choice, housing markets and house allocation with existing tenants. We show how the previously known solvable cases can be viewed as extreme cases of solvable environments. For sufficiency of our conditions we introduce a version of the agent-proposing deferred acceptance algorithm with exogenous and preference-based tie-breaking

Preference reversals in judgment and choice

According to normative decision theory there exists a principle of procedure invariance which states that a decision maker's preference order should remain the same, independently of which response mode is used. For example, the decision maker should express the same preference independently of whether he or she has to judge or decide. Nevertheless, previous research in behavioral decision making has suggested that judgments and choices yield different preference orders in both the risky and the riskless domain. In the latter, the prominence effect has been demonstrated. The main purpose of the present series of experiments was to test cognitive explanations which account for the prominence effect. One of the explanations provided a psychological account based primarily on decision-strategy compatibility. Two other explanations built on information structuring approaches. In the first one, the general idea was that decision makers differentiate between alternatives by value and belief restructuring. In the second approach, violations of invariance were assumed to be attributed to the information structure of the task which in many cases demand problem simplification. A prominence effect was in most experiments found for both choices and preference ratings. This finding spöke against the strategy compatibility explanation. Instead, the different forms of cognitive restructuring provided a better account. However, none of these provided a single explanation. Yet, the structure compatibility explanation appeared to be the more viable one, in particular of the relation between experimentäl manipulations and response mode outcomes. The predictions of the value-belief restructuring explanation, on the other hand, seemed to be more valid for the prominence effect found in choice than for preference ratings

Engineering band structure via the site preference of Pb2+ in the In+ site for enhanced thermoelectric performance of In6Se7

Although binary In-Se based alloys as thermoelectric (TE) candidates are of interests in recent years, little attention has been paid into In6Se7 based compounds. With substituting Pb in In6Se7, the preference of Pb2+ in the In+ site has been observed, allowing the Fermi level (Fr) shift towards the conduction band and the localized state conduction becomes dominated. Consequently, the Hall carrier concentration (nH) has been enhanced significantly with the highest nH value being about 2~3 orders of magnitude higher than that of Pb-free sample. Meanwhile, the lattice thermal conductivity (κL) tends to be reduced as nH value increases, owing to an increased phonon scattering on carriers. As a result, a significantly enhanced TE performance has been achieved with the highest TE figure of merit (ZT) of 0.4 at ~850 K. This ZT value is 27 times that of intrinsic In6Se7 (ZT=0.015 at 640 K), which proves a successful band structure engineering through site preference of Pb in In6Se7

Condorcet Domains, Median Graphs and the Single Crossing Property

Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters belong to this set, the majority relation has no cycles. We observe that, without loss of generality, such domain can be assumed to be closed in the sense that it contains the majority relation of every profile with an odd number of individuals whose preferences belong to this domain. We show that every closed Condorcet domain is naturally endowed with the structure of a median graph and that, conversely, every median graph is associated with a closed Condorcet domain (which may not be a unique one). The subclass of those Condorcet domains that correspond to linear graphs (chains) are exactly the preference domains with the classical single crossing property. As a corollary, we obtain that the domains with the so-called `representative voter property' (with the exception of a 4-cycle) are the single crossing domains. Maximality of a Condorcet domain imposes additional restrictions on the underlying median graph. We prove that among all trees only the chains can induce maximal Condorcet domains, and we characterize the single crossing domains that in fact do correspond to maximal Condorcet domains. Finally, using Nehring's and Puppe's (2007) characterization of monotone Arrowian aggregation, our analysis yields a rich class of strategy-proof social choice functions on any closed Condorcet domain

Distance and consensus for preference relations corresponding to ordered partitions

Ranking is an important part of several areas of contemporary research, including social sciences, decision theory, data analysis and information retrieval. The goal of this paper is to align developments in quantitative social sciences and decision theory with the current thought in Computer Science, including a few novel results. Specifically, we consider binary preference relations, the so-called weak orders that are in one-to-one correspondence with rankings. We show that the conventional symmetric difference distance between weak orders, considered as sets of ordered pairs, coincides with the celebrated Kemeny distance between the corresponding rankings, despite the seemingly much simpler structure of the former. Based on this, we review several properties of the geometric space of weak orders involving the ternary relation “between”, and contingency tables for cross-partitions. Next, we reformulate the consensus ranking problem as a variant of finding an optimal linear ordering, given a correspondingly defined consensus matrix. The difference is in a subtracted term, the partition concentration, that depends only on the distribution of the objects in the individual parts. We apply our results to the conventional Likert scale to show that the Kemeny consensus rule is rather insensitive to the data under consideration and, therefore, should be supplemented with more sensitive consensus schemes