The presence of lattice theory in discrete problems of mathematical social sciences. Why.

DOI10.1016/S0165-4896(03)00072-6zbMath1054.91062MaRDI QIDQ1414820

Bernard Monjardet

Publication date: 4 December 2003

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

Galois latticeClosure operatorBinary relationSet system

Mathematics Subject Classification ID

Matching models (91B68)

Related Items (16)

Rough approximation operators on two universes of discourse and their fuzzy extensions ⋮ SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ Entropy of capacities on lattices and set systems ⋮ Ensemble clustering in the belief functions framework ⋮ Games on concept lattices: Shapley value and core ⋮ Knowledge Spaces and Reduction of Covering Approximation Spaces ⋮ Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation ⋮ Representing uncertainty on set-valued variables using belief functions ⋮ The multiple facets of the canonical direct unit implicational basis ⋮ Belief functions on lattices ⋮ Belief Functions and Cluster Ensembles ⋮ A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis ⋮ Lattices in Social Networks with Influence ⋮ Distributive Lattice Polyhedra ⋮ Moore systems and Moore convergence classes of families of nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice valuations, medians and majorities
• Every finite distributive lattice is a set of stable matchings
• The jump number and the lattice of maximal antichains
• Greedoids
• The theory of convex geometries
• What can lattices do for experimental designs?
• What is an analysis of variance?
• N-trees as nestings: Complexity, similarity, and consensus
• The poset of closures as a model of changing databases
• Combinatorial representation and convex dimension of convex geometries
• The median procedure in cluster analysis and social choice theory
• The core of finite lattices
• Global games
• The Shapley value for cooperative games under precedence constraints
• Functional dependencies in relational databases: A lattice point of view
• Latticial structures in data analysis.
• Choice functions and abstract convex geometries
• A theory of finite closure spaces based on implications
• The Shapley value on convex geometries
• A characterization theorem for the canonical basis of a closure operator
• A note on the correspondence among entail relations, rough set dependencies, and logical consequence
• Lattices of choice functions and consensus problems
• Simplicial elimination schemes, extremal lattices and maximal antichain lattices
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
• Neutral consensus functions
• Locally atomic upper locally distributive lattices
• Lattices with unique irreducible decompositions
• A Formal Theory of Consensus
• Rough sets
• The Factorization and Representation of Lattices
• Knowledge Spaces
• On the Foundations of Combinatorial Theory II. Combinatorial Geometries
• A Fixed-Point Approach to Stable Matchings and Some Applications
• Incomplete information: rough set analysis
• Theory of Matroids
• College Admissions and the Stability of Marriage
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
• On preferences over subsets and the lattice structure of stable matchings
• On computing the size of a lattice and related decision problems

This page was built for publication: The presence of lattice theory in discrete problems of mathematical social sciences. Why.