[PDF] Top 20 PP 2012 03: Logic and Social Choice Theory

... of social choice theory, by altering the notion of preference, the notion of ballot, or ...of social choice mechanisms where the language used to express (declared) ballots does not ... See full document

... from social choice theory, namely Sen’s Theorem [32] on the impossibility of a Paretian liberal and the Muller-Satterthwaite Theorem [23], thereby demonstrating the generality and flexibility of our ... See full document

... First published in 1951, Arrow’s Theorem is widely regarded as the seminal contributions to social choice theory [3]. The original theorem concerns social welfare functions, i.e., func- tions ... See full document

... for social choice theory that model different aspects of collective decision making: deciding on a fair allocation of resources to agents, making a choice affecting all agents in view of their ... See full document

... Abstract. The problem of merging several ontologies has important ap- plications in the Semantic Web, medical ontology engineering, and other domains where information from several distinct sources needs to be in- ... See full document

... from logic and automated reasoning have been applied to modelling and verifying results from economic ...to social choice theory, which is closely related to the problem domain we focus on in ... See full document

... computational social choice (or certain parts thereof) has been surveyed by several ...to social choice in combinatorial ...of logic in social choice theory, ... See full document

... Keywords: Judgment Aggregation, Logical Aggregation, Doctrinal Paradox, Discursive Dilemma, General Logic, Premiss-Based vs Conclusion-Based Approach, Social Choice Theory, Impossibility[r] ... See full document

... process theory did emerge with many features that have no counterpart in the classical theory of sequential computing (van Emde Boas ...a theory of computing on infinite streams, tied to ... See full document

... in logic, since correlations provide “information channels” where the behavior of one agent can carry information about that of another (Barwise and Seligman, ...sophisticated theory of agent ... See full document

... that social welfare is maximized or certain fairness con- ditions ...List, 2012, and List and Puppe, 2009) where individual judges express possibly different opinions on whether some logically connected ... See full document

... probability theory in the seventieth century with its crucial notion of expected ...dynamic–epistemic logic has many candidates (cf. Liu 2012), but I will make no concrete proposal ... See full document

... for social choice theory but that has only received little attention to date is automated ...in social choice theory and to search for new ones; it might be used to automatically ... See full document

... of social choice precise by providing a suitable formal framework for its analysis and to propose a number of simple procedures that fit this framework, together with an initial analysis of some of their ... See full document

... process theory One major challenge around 1980 was a theoretical reflection on the practice of distributed computing emerging at the ...process theory did emerge with many features that have no counterpart ... See full document

... Modern quantum theory is a conceptual framework relating states and observables in a dynamic way. States are describing aspects of the physical world, observables relate to meaningful questions we can ask about ... See full document

... modern social choice ...time, social choice became a field investigated by computer scientists from various fields (espe- cially artificial intelligence, operations research, and theoretical ... See full document

... into logic? One analysis makes BI a process of prior deliberation by players whose minds proceed in harmony, though they need not communicate in reality (van Benthem ... See full document

... We now extend our logic to deal with the dynamics of networks. We will make two important design choices. First, we are concerned exclusively with one particular type of changes within networks: the change of ... See full document

... By substituting atom p in Formula 1 with a Boolean compound ϕ (i.e., ϕ := p ∧ q) we can say that “a belongs to both the sets called p and q”, and the same can be done for all other Boolean connectives. However, what is ... See full document