Country: United States

Found 17049 papers in total
A fixed point approach to the classification of Markov chains with a tree structure
A fixed point approach to the classification of Markov chains with a tree structure
2003,
In this paper, we study the classsification problem of discrete time and continuous...
On block skip free transition matrices and first passage times
On block skip free transition matrices and first passage times
2003,
Starting from an abstract setting which extends the property ‘skip free to the...
Estimation methods for delays in non-regenerative discrete-event systems
Estimation methods for delays in non-regenerative discrete-event systems
2003,
Many long-run delay characteristics of computer, communication, manufacturing, and...
A fixed-point approach to stable matchings and some applications
A fixed-point approach to stable matchings and some applications
2003,
We describe a fixed-point based approach to the theory of bipartite stable matchings....
A note on clique-web facets for multicut polytopes
A note on clique-web facets for multicut polytopes
2002,
In this note we provide a previously undiscovered necessary condition for the...
A generalization of the perfect graph theorem under the disjunctive index
A generalization of the perfect graph theorem under the disjunctive index
2002,
In this paper, we relate antiblocker duality between polyhedra, graph theory, and the...
Continuous characterizations of the maximum clique problem
Continuous characterizations of the maximum clique problem
1997,
Given a graph G whose adjacency matrix is A , the Motzkin–Strauss formulation of...
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time
1997,
Many important cutting planes have been discovered for the traveling salesman problem....
Learning classifier system for graph coloring
Learning classifier system for graph coloring
1998,
In this paper the role of genetic algorithms and classifiers systems in the graph...
Solution of a functional equation arising in continuous games: A dynamic programming approach
Solution of a functional equation arising in continuous games: A dynamic programming approach
2002,
This paper deals with a functional equation in a zero-sum continuous game. The...
Zero-sum semi-Markov games
Zero-sum semi-Markov games
2002,
This paper deals with Borel state and action spaces zero-sum semi-Markov games under...
On the complexity of coordination
On the complexity of coordination
2003,
Many results on repeated games played by finite automata rely on the complexity of the...
Cost allocation for a tree network with heterogeneous customers
Cost allocation for a tree network with heterogeneous customers
2002,
We analyze a cost allocation problem which could naturally arise from a situation...
Cooperation indices and weighted Shapley values
Cooperation indices and weighted Shapley values
1997,
The weighted Shapley values are extended to situations defined by a cooperative game...
On the determinateness of m × infinity bimatrix games
On the determinateness of m × infinity bimatrix games
1997,
In this paper a positive answer is given to the question of whether every...
Potentials and weighted values of nonatomic games
Potentials and weighted values of nonatomic games
1997,
The ‘potential approach’ to value theory for finite games was introduced...
Contraction conditions for average and alpha-discount optimality in countable state Markov games with unbounded rewards
Contraction conditions for average and alpha-discount optimality in countable state Markov games with unbounded rewards
1997,
The goal of this paper is to provide a theory of N-person Markov games with unbounded...
Stationary strategies for recursive games
Stationary strategies for recursive games
1997,
We study two-person, zero-sum recursive matrix games framing them in the more general...
On the convergence of fictitious play
On the convergence of fictitious play
1998,
We study the Brown–Robinson fictitious play process for non-zero sum games. We...
Complexity of the minimum base game on matroids
Complexity of the minimum base game on matroids
1997,
This paper studies the complexity of computing solution concepts for a cooperative...
The circuit polytope: Facets
The circuit polytope: Facets
1997,
Given an undirected graph G = (V, E) and a cost vector c ∈ R(E), the weighted...
Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems
Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems
2003,
Based on an inverse function theorem for a system of semismooth equations, this paper...
Nondegeneracy concepts for zeros of piecewise smooth functions
Nondegeneracy concepts for zeros of piecewise smooth functions
1998,
A zero of a piecewise smooth function F , is said to be nondegenerate if the function...
A class of selection procedures based on sample quasi-ranges
A class of selection procedures based on sample quasi-ranges
2002,
Let E i = E(μ i , θ i ), = 1,....,k be k independent exponential...
Papers per page: