Results 1  10
of
45,168
The Combinatorial Structure of the . . .
, 1989
"... The combinatorial structure of the generalized nullspace of a block triangular matrix with entries in an arbitrary field is studied. Using an extension lemma, we prove the existence of a weakly preferred basis for the generalized nullspace. Independently, we study the height of generalized nullvecto ..."
Abstract
 Add to MetaCart
The combinatorial structure of the generalized nullspace of a block triangular matrix with entries in an arbitrary field is studied. Using an extension lemma, we prove the existence of a weakly preferred basis for the generalized nullspace. Independently, we study the height of generalized
Learning to Predict Combinatorial Structures
"... Structured prediction algorithms infer a joint scoring function on inputoutput pairs and, for a given input, predict the output that maximises this scoring function. Existing approaches can be trained in polynomial time only if deciding whether no output with a score higher than a given output exis ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
exists (optimality) is in NP. Often stronger assumptions are needed to ensure polynomial time complexity. For combinatorial structures such as directed cycles and partially ordered sets, optimality is coNPcomplete and these assumptions do not hold. In this paper, we present an algorithm that overcomes
Combinatorial structures in nonlinear programming
 Operations Research
, 2004
"... Nonsmoothness and nonconvexity in optimization problems often arise because a combinatorial structure is imposed on smooth or convex data. The combinatorial aspect can be explicit, e.g. through the use of ”max”, ”min”, or ”if ” statements in a model, or implicit as in the case of bilevel optimizat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Nonsmoothness and nonconvexity in optimization problems often arise because a combinatorial structure is imposed on smooth or convex data. The combinatorial aspect can be explicit, e.g. through the use of ”max”, ”min”, or ”if ” statements in a model, or implicit as in the case of bilevel
Simple extensions of combinatorial structures
, 2010
"... An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this i ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes
Dual Games on Combinatorial Structures
"... In the classical model of cooperative games it is generally assumed that there are no restrictions on cooperation and hence, every subset of players is a feasible coalition. However, in many social and economic situations, this model does not apply. Examples are provided by local public goods which ..."
Abstract
 Add to MetaCart
are supplied by local communities, social and sports clubs, labor unions, political parties, and other institutions. We will define the feasible coalitions by using the dual combinatorial structures called convex geometries and antimatroids. We introduce the Shapley and Banzhaf values for these games
Random Combinatorial Structures and Prime Factorizations
, 1997
"... Many combinatorial structures decompose into components, with the list of component sizes carrying substantial information. An integer factors into primes—this is a similar situation, but different ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Many combinatorial structures decompose into components, with the list of component sizes carrying substantial information. An integer factors into primes—this is a similar situation, but different
Combinatorial Structure of Constructible Complexes
 Master’s thesis
, 1997
"... This thesis is a study of the combinatorial structure of a certain kind of complexes: constructible complexes and strongly constructible complexes. The notion of constructible complexes is known as a weaker notion than that of shellable complexes, and this thesis is aimed to be a foundation of the s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This thesis is a study of the combinatorial structure of a certain kind of complexes: constructible complexes and strongly constructible complexes. The notion of constructible complexes is known as a weaker notion than that of shellable complexes, and this thesis is aimed to be a foundation
Random combinatorial structures and . . .
, 2010
"... This thesis is concerned with the probabilistic analysis of random combinatorial structures and the runtime analysis of randomized search heuristics. On the subject of random structures, we investigate two classes of combinatorial objects. The first is the class of planar maps and the second is the ..."
Abstract
 Add to MetaCart
This thesis is concerned with the probabilistic analysis of random combinatorial structures and the runtime analysis of randomized search heuristics. On the subject of random structures, we investigate two classes of combinatorial objects. The first is the class of planar maps and the second
On the impact of combinatorial structure on congestion games
 in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS
"... We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence
Results 1  10
of
45,168