Pages that link to "Item:Q1303880"

The following pages link to Choice functions and abstract convex geometries (Q1303880):

Displaying 43 items.

• On critical sets of a finite Moore family (Q481926) (← links)
• On the shelling antimatroids of split graphs (Q510993) (← links)
• Embedding convex geometries and a bound on convex dimension (Q512594) (← links)
• Mixture sets on finite domains (Q604678) (← links)
• A system-theoretic model for cooperation, interaction and allocation (Q643011) (← links)
• The affine representation theorem for abstract convex geometries (Q705549) (← links)
• A hyper-relation characterization of weak pseudo-rationalizability (Q826921) (← links)
• Orders on subsets rationalised by abstract convex geometries (Q841164) (← links)
• Extreme point axioms for closure spaces (Q856869) (← links)
• Matroids on convex geometries (cg-matroids) (Q882114) (← links)
• The computational complexity of rationalizing behavior (Q972378) (← links)
• Choice functions and extensive operators (Q1016094) (← links)
• The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
• Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
• WARP and combinatorial choice (Q1693195) (← links)
• Antimatroids induced by matchings (Q1730258) (← links)
• Path-independence and closure operators with the anti-exchange property (Q1766745) (← links)
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey (Q1874537) (← links)
• Closure and preferences (Q2178596) (← links)
• A discrete duality between nonmonotonic consequence relations and convex geometries (Q2183103) (← links)
• A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem (Q2197095) (← links)
• Rationalizable choice functions (Q2206803) (← links)
• Choice resolutions (Q2235096) (← links)
• Path independent choice and the ranking of opportunity sets (Q2247947) (← links)
• Transformations of discrete closure systems (Q2250810) (← links)
• Description of closure operators in convex geometries of segments on the line (Q2330861) (← links)
• Substitutable choice functions and convex geometry (Q2345620) (← links)
• Moore systems and Moore convergence classes of families of nets (Q2350690) (← links)
• Essentiality and convexity in the ranking of opportunity sets (Q2361508) (← links)
• Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
• Statement of precedence and a comment on IIA terminology (Q2427140) (← links)
• Mathematics of Plott choice functions (Q2486161) (← links)
• A new characterization of the path independent choice functions (Q2507242) (← links)
• Resolutions of convex geometries (Q2665967) (← links)
• (Q2741273) (← links)
• Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
• On Capacity-Filling and Substitutable Choice Rules (Q4958546) (← links)
• SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES (Q5294338) (← links)
• A Hierarchical Model for Cooperative Games (Q5459987) (← links)
• The duality between the anti-exchange closure operators and the path independent choice operators on a finite set (Q5932330) (← links)
• Locally complete path independent choice functions and their lattices (Q5939662) (← links)
• CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE (Q6041349) (← links)
• Convex rough sets on finite domains (Q6122303) (← links)