scientific article; zbMATH DE number 1131289

Publication date: 22 March 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

social choice choice functions choice theory collective choices rationality conditions individual choices

Transportation, logistics and supply chain management (90B06) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Social choice (91B14)

Related Items

Utility representation via additive or multiplicative error functions., Extending tournament solutions, Choice stabilities in the graph model for conflict resolution, Paretian quasi-orders: the regular two-agent case, Simple collective identity functions, Continuously representable Paretian quasi-orders, An axiomatization of the generalized Edgeworth-Pareto principle in terms of choice functions, Stochastic demand correspondences and their aggregation properties, Simple structures in problems of control theory: formalization and synthesis, Counting combinatorial choice rules, Minimal extending sets in tournaments, Limits on power and rationality, Properties of a choice function generated by a binary relation on convex subsets, Choice via grouping procedures, State dependent choice, Properties and Complexity of Some Superposition Choice Procedures, On rational choice from lists of sets, Rationalization of indecisive choice behavior by pluralist ballots, A distance measure for choice functions, A comment on Arrow's impossibility theorem, A method for discriminating efficient candidates with ranked voting data., Arrowian social equilibrium: indecisiveness, influence and rational social choices under majority rule, Set-monotonicity implies Kelly-strategyproofness, Set-rationalizable choice and self-stability, On the structure of stable tournament solutions, A model of noncompensatory aggregation with an arbitrary collection of grades, Binary relations: Finite characterizations and computational complexity, Voting Procedures, Complexity of, On the existence of maximal elements: An impossibility theorem, Domain closedness conditions and rational choice, Stability criteria in vector combinatorial bottleneck problems in terms of binary relations, Reducing a multi stage vector optimization problem to a single stage vector optimization problem., The duality between the anti-exchange closure operators and the path independent choice operators on a finite set, Axiomatic characterizations of voting operators, Mathematics of Plott choice functions, Social threshold aggregations, A characterization of prudent choices, Set and revealed preference axioms for multi-valued choice, Characterizing Paretian preferences, The history of social choice in Russia and the Soviet Union, Making choices with a binary relation: relative choice axioms and transitive closures, Ranking Journals in Sociology, Education, and Public Administration by Social Choice Theory Methods, A new characterization of the path independent choice functions, Choice functions and hard choices, Path-independent consideration, Choice functions and extensive operators, `\(q\)-Pareto-scalar' two-stage extremization model and its reducibility to one-stage model, Approval as an Intrinsic Part of Preference, Choosers as extension axioms, Revealed desirability: a novel instrument for social welfare, A representation for intransitive indifference relations, Approval voting under dichotomous preferences: a catalogue of characterizations, Sequential rationalization of multivalued choice, Numerical representation of binary relations with a multiplicative error function, Binary representation of choice rationalizable by a utility function with an additive non-negative error function