SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES

DOI10.1142/S0219198907001242zbMath1115.06004MaRDI QIDQ5294338

Bernard Monjardet

Publication date: 24 July 2007

Published in: International Game Theory Review (Search for Journal in Brave)

zbMATH Keywords

dualityGalois connectionchoice functionbinary relationsocial choicepreference aggregationsimple gameclosure systemimplicational system

Mathematics Subject Classification ID

Cooperative games (91A12) Social choice (91B14) Abstract deductive systems (03B22) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Spaces of games (91A70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functional dependencies in Horn theories
• Latticial structures in data analysis.
• Choice functions and abstract convex geometries
• The presence of lattice theory in discrete problems of mathematical social sciences. Why.
• Effectivity functions and stable governance structures
• A partition-based approach towards constructing Galois (concept) lattices
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Path Independence, Rationality, and Social Choice
• An Axiomatic Theory of Tournament Aggregation
• Knowledge Spaces
• A Possibility Theorem on Majority Decisions
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
• Locally complete path independent choice functions and their lattices

This page was built for publication: SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES