In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and inâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Christophe Gonzales, Patrice Perny, Sergio Queiroz
- AAAI
- 2008

This paper deals with preference representation and aggregation in the context of multiattribute utility theory. We consider aâ€¦Â (More)

Is this relevant?

2004

2004

- Ralph Kopperman, John L. Pfaltz
- IWCIA
- 2004

In this paper we develop a discrete, T0 topology in which (1) closed sets play a more prominent role than open sets, (2) atomsâ€¦Â (More)

Is this relevant?

2004

2004

- E. Algabaa, J. M. Bilbaoa, R. van den Brinkb
- 2004

The aim of this paper is to introduce cooperative games with a feasible coalition system which is called antimatroid. Theseâ€¦Â (More)

Is this relevant?

2003

2003

- Yulia Kempner, Vadim E. Levit
- Electr. J. Comb.
- 2003

The basic distinction between already known algorithmic characterizations of matroids and antimatroids is in the fact that forâ€¦Â (More)

Is this relevant?

2002

2002

- Gary A. Gordon
- 2002

We consider a probabilistic antimatroid A on the ground set E, where each element e âˆˆ E may succeed with probability pe. We focusâ€¦Â (More)

Is this relevant?

1998

1998

Investigation of the transformations of vector spaces, whose most abstract formulations are called matroids, is basic inâ€¦Â (More)

Is this relevant?

1998

1998

Often the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimalâ€¦Â (More)

Is this relevant?

1997

1997

- Gary G. Gordon
- 1997

We extend Crapoâ€™s Î² invariant from matroids to greedoids, concentrating especially on antimatroids. Several familiar expansionsâ€¦Â (More)

Is this relevant?

1992

1992

- Paul Glasserman, David D. Yao
- Math. Oper. Res.
- 1992

A generalized semi-Markou scheme models the structure of a discrete event system, such as a network of queues. By studyingâ€¦Â (More)

Is this relevant?

1989

1989

- Michele Conforti, Monique Laurent
- Math. Program.
- 1989

A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence system 5â€¦Â (More)

Is this relevant?