Journal: Mathematics of Operations Research

Found 1103 papers in total
A closed form solution for the asymmetric random polling system with corrected Levy input process
A closed form solution for the asymmetric random polling system with corrected Levy input process
1997,
We introduce a simple approach for modeling and analyzing the random polling system...
Stability of multiclass queueing networks under first-in-first-out service discipline
Stability of multiclass queueing networks under first-in-first-out service discipline
1997,
In this paper, we first formally identify a first-in first-out (FIFO) fluid network...
The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability
The delay of open Markovian queueing networks: Uniform functional bounds, heavy traffic pole multiplicities, and stability
1997,
For open Markovian queueing networks, we study the functional dependence of the mean...
Approximating extreme points of infinite dimensional convex sets
Approximating extreme points of infinite dimensional convex sets
1998,
The property that an optimal solution to the problem of minimizing a continuous...
Integral polyhedra related to even-cycle and even-cut matroids
Integral polyhedra related to even-cycle and even-cut matroids
2002,
A family of sets ℋ is ideal if the polyhedron {x ≥ 0 : Σ i∈S x i...
A separation algorithm for b-matching degree-sequence polyhedra
A separation algorithm for b-matching degree-sequence polyhedra
2003,
A b -matching of a graph is an assignment of non-negative integers to edges such that...
Calibration with many checking rules
Calibration with many checking rules
2003,
Each period an outcome (out of finitely many possibilities) is observed. For...
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...
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...
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...
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...
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...
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...
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...
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...
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...
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...
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...
Vector summation in Banach space and polynomial algorithms for flow shops and open shops
Vector summation in Banach space and polynomial algorithms for flow shops and open shops
1995,
We consider the flow shop and the open shop problems with m machines and n jobs; M is...
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...
Conservation laws, extended polymatroids and multiarmed bandit problems: A polyhedral approach to indexable systems
Conservation laws, extended polymatroids and multiarmed bandit problems: A polyhedral approach to indexable systems
1996,
We show that if performance measures in stochastic and dynamic scheduling problems...
A polynomial algorithm for multiprocessor scheduling with two job lengths
A polynomial algorithm for multiprocessor scheduling with two job lengths
2001,
The following multiprocessor scheduling problem was motivated by scheduling...
Improved approximation schemes for scheduling unrelated parallel machines
Improved approximation schemes for scheduling unrelated parallel machines
2001,
We consider the problem of scheduling n independent jobs on m unrelated parallel...
Mean-variance portfolio selection with random parameters in a complete market
Mean-variance portfolio selection with random parameters in a complete market
2002,
The paper concerns the continuous-time, mean-variance portfolio selection problems in...
Papers per page: