Results 61 to 70 of about 114 (83)
Geometry of poset antimatroids
Electronic Notes in Discrete Mathematics, 2013 Abstract An antimatroid is an accessible set system closed under union. A poset antimatroid is a particular case of antimatroid, which is formed by the lower sets of a poset. Feasible sets in a poset antimatroid ordered by inclusion form a distributive lattice, and every distributive lattice can be formed in this way.
Vadim Levit, Yulia Kempner
exaly +2 more sources
Excluded-minor characterizations of antimatroids arisen from posets and graph searches [PDF]
Discrete Applied Mathematics, 2003 An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an ‘antipodal’ concept of matroid.We shall show that an antimatroid is derived from shelling of a poset if and ...
Nakamura, M.
exaly +2 more sources
Closure spaces that are not uniquely generated [PDF]
Discrete Applied Mathematics, 2005 Because antimatroid closure spaces satisfy the anti-exchange axiom, it is easy to show that they are uniquely generated. That is, the minimal set of elements determining a closed set is unique.
John Lucas Pfaltz
exaly +2 more sources
Chip-Firing, Antimatroids, and Polyhedra
Electronic Notes in Discrete Mathematics, 2009 Abstract Starting from the chip-firing game of Bjorner and Lovasz we consider a generalization to vector addition systems that still admit algebraic structures as sandpile group or sandpile monoid. Every such vector addition language yields an antimatroid. We show that conversely every antimatroid can be represented this way.
Kolja Knauer
exaly +3 more sources
Axiomatizations of the Shapley value for cooperative games on antimatroids [PDF]
Mathematical Methods of Operations Research, 2003 The paper provides an axiomatization of the Shapley value in cooperative games in which asymmetries in allowable coalitions is described by restricting the set of possible coalitions to be {antimatroids}. Asymmetries among the players of a cooperative game have been studied in the literature in different ways.
Encarnación Algaba +2 more
exaly +9 more sources
Some of the next articles are maybe not open access.
Cooperative games with nontransferable utility on antimatroids
International Journal of General Systems, 2018ABSTRACTThis paper introduces a new family of nontransferable utility (NTU) games with partial cooperation. Games with transferable utility (TU) restricted by antimatroids were studied since 2004.
Andrés Jiménez-Losada +1 more
openaire +1 more source
Abstract Convexity — Antimatroids
1991If we abstract the combinatorial properties of convexity in a manner similar to the abstraction of linear dependence in matroid theory, we obtain antimatroids. Interest in these structures has its sources in different fields of mathematics.
Bernhard Korte +2 more
openaire +1 more source
Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
Operations Research Letters, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Antimatroids of finite character
Journal of Geometry, 2001This paper provides an axiomatization of antimatroids (``convex geometries''; see \textit{P. H. Edelmann} and \textit{R. E. Jamison,} [Geom. Dedicata 19, 247-270 (1985; Zbl 0577.52001)]) that also works for the moderately infinite case of ``finite character'', where any union of a chain of closed sets is again closed.
openaire +1 more source
The Global Rank Axioms for Poset Antimatroids
2012 International Conference on Industrial Control and Electronics Engineering, 2012The concept of rank function of the poset antimatroid is introduced, and the rank axioms for poset antimatroids are investigated. A "pseudo-global" rank axioms are presented for poset antimatroids. Some properties of poset antimatroid are obtained.
Li Yao-Long, Wang Min
openaire +1 more source