Research Article

Repeated Games with Endogenous Choice of Information Mechanisms

Pages:785–794

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.785

Generalized “Big-Match”

Pages:795–816

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.795

Mean Cost Cyclical Games

Pages:817–828

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.817

Ill-Conditioned Convex Processes and Conic Linear Systems

Pages:829–834

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.829

Stochastic Orderings of Convex/Concave-Type on an Arbitrary Grid

Pages:835–846

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.835

Interlacing Eigenvalues in Time Reversible Markov Chains

Pages:847–864

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.847

Spatial Queueing Processes

Pages:865–886

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.865

Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases

Pages:887–910

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.887

Two-Machine No-Wait Flow Shop Scheduling with Missing Operations

Pages:911–924

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.911

Erratum

Free Access
Erratum: A Sharp Upper Bound for the Expected Number of Shadow Vertices in LP-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes

Pages:925–984

Published Online:November 1, 1999

https://doi.org/10.1287/moor.24.4.925

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.