Results 31 to 40 of about 114 (83)

A circuit set characterization of antimatroids

open access: yesJournal of Combinatorial Theory, Series B, 1987
Antimatroids generalize the notion of convexity in much the same way as matroids generalize the notion of linear dependence. Definitions and examples of antimatroids are presented. Rooted circuits of antimatroids are defined, and a new characterization of antimatroids is given.
openaire   +3 more sources

A Value for Games Restricted by Augmenting Systems [PDF]

open access: yes, 2010
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of nonfeasible coalitions.
Bilbao Arrese, Jesús Mario   +7 more
core   +2 more sources

Poly-Dimension of Antimatroids

open access: yes, 2012
A partial cube is a graph that can be isometrically embedded into a hypercube. In other words, a partial cube is a subgraph of a hypercube that preserves distances the distance between any two vertices in the subgraph is the same as the distance between those vertices in the hypercube.
Yulia Kempner, Vadim E.
openaire   +2 more sources

Mixture sets on finite domains

open access: yes
Mixture set, Antimatroid, D8,
Matthew Ryan
core   +1 more source

Countable ultrahomogeneous antimatroids of convex dimension 2 [PDF]

open access: yesDiscrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The 2-Shapley value for bicooperative games

open access: yes
In this paper, we propose a new Shapley-type value (the 2-Shapley value) for bico- operative games. Unlike classical cooperative games, bicooperative games assign values to pairs of disjoint coalitions (bicoalitions) representing players who support ...
Basallote Galván, Manuela   +2 more
core   +1 more source

Two Characterizations of Antimatroids

open access: yesAnnals of the Alexandru Ioan Cuza University - Mathematics, 2013
Abstract NextClosure algorithm is a fast and good algorithm in formal concept analysis. With the assistance of NextClosure algorithm, this article provides a characterization of antimatroids. Additionally, this article introduces a characterization of k- truncated antimatroids.
openaire   +1 more source

Axiomatizations of the Shapley Value for Cooperative Games on Antimatroids [PDF]

open access: yes
AMS classification: 91A12;cooperative games;antimatroid;permission structure;Shapley ...
Algaba, A.   +3 more
core  

Antimatroids and oracle complexity

open access: yes, 1999
Antimatroids are a new and growing area of mathematics. They arise out of matroids and greedoids, and have a rich structure of their own, as is most naturally seen when considering convex closure in Euclidean space.
Enright, Jamas
core   +1 more source

Home - About - Disclaimer - Privacy