Country: United States

Found 17049 papers in total
Simultaneous multiple comparisons with the worst and best
Simultaneous multiple comparisons with the worst and best
2002,
Suppose that there are k ≥ 2 independent populations (treatments or systems), where...
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...
Calibration with many checking rules
Calibration with many checking rules
2003,
Each period an outcome (out of finitely many possibilities) is observed. For...
Complexity of the Economic Lot Schedule Problem with general cyclic schedules
Complexity of the Economic Lot Schedule Problem with general cyclic schedules
1997,
We show that the Economic Lot Schedule Problem is NP-hard in the strong sense under...
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...
An adaptable problem-space-based search method for flexible flow line scheduling
An adaptable problem-space-based search method for flexible flow line scheduling
1997,
Problem-space-based neighbourhoods have been recently suggested in the literature for...
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...
Scheduling policies, batch sizes, and manufacturing lead times
Scheduling policies, batch sizes, and manufacturing lead times
1997,
In this paper we examine the impact of scheduling policies on batch sizing decisions...
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...
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...
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...
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...
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...
Papers per page: