Choice functions and abstract convex geometries
From MaRDI portal
Publication:1303880
DOI10.1016/S0165-4896(98)00044-4zbMath0943.91031OpenAlexW2160847856MaRDI QIDQ1303880
Publication date: 22 September 1999
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-4896(98)00044-4
Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Social choice (91B14)
Related Items
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Essentiality and convexity in the ranking of opportunity sets ⋮ A hyper-relation characterization of weak pseudo-rationalizability ⋮ SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES ⋮ Orders on subsets rationalised by abstract convex geometries ⋮ Notions from rough set theory in a generalized dependency relation context ⋮ Dual greedy polyhedra, choice functions, and abstract convex geometries ⋮ Extreme point axioms for closure spaces ⋮ Unnamed Item ⋮ Mixture sets on finite domains ⋮ Resolutions of convex geometries ⋮ Closure and preferences ⋮ Matroids on convex geometries (cg-matroids) ⋮ A discrete duality between nonmonotonic consequence relations and convex geometries ⋮ CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE ⋮ Convex rough sets on finite domains ⋮ WARP and combinatorial choice ⋮ Statement of precedence and a comment on IIA terminology ⋮ A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem ⋮ Rationalizable choice functions ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ A system-theoretic model for cooperation, interaction and allocation ⋮ Antimatroids induced by matchings ⋮ On critical sets of a finite Moore family ⋮ Choice resolutions ⋮ On the shelling antimatroids of split graphs ⋮ Embedding convex geometries and a bound on convex dimension ⋮ Path independent choice and the ranking of opportunity sets ⋮ Transformations of discrete closure systems ⋮ The duality between the anti-exchange closure operators and the path independent choice operators on a finite set ⋮ Mathematics of Plott choice functions ⋮ Path-independence and closure operators with the anti-exchange property ⋮ The computational complexity of rationalizing behavior ⋮ Locally complete path independent choice functions and their lattices ⋮ The affine representation theorem for abstract convex geometries ⋮ A new characterization of the path independent choice functions ⋮ On Capacity-Filling and Substitutable Choice Rules ⋮ A Hierarchical Model for Cooperative Games ⋮ Choice functions and extensive operators ⋮ Description of closure operators in convex geometries of segments on the line ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ Substitutable choice functions and convex geometry ⋮ Moore systems and Moore convergence classes of families of nets
Cites Work
