Analysis of Sample-Path Optimization

Pages:513–528

Published Online:August 1, 1996

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

A Faster Combinatorial Algorithm for the Generalized Circulation Problem

Pages:529–539

Published Online:August 1, 1996

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

Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions

Pages:540–554

Published Online:August 1, 1996

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

Subgradients of Optimal-Value Functions in Dynamic Programming: The Case of Convex Systems Without Optimal Paths

Pages:555–575

Published Online:August 1, 1996

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

Derivatives of Spectral Functions

Pages:576–588

Published Online:August 1, 1996

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

Global Methods for Nonlinear Complementarity Problems

Pages:589–614

Published Online:August 1, 1996

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

Convergence Analysis of Stochastic Algorithms

Pages:615–628

Published Online:August 1, 1996

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

Properties of an Interior-Point Mapping for Mixed Complementarity Problems

Pages:629–654

Published Online:August 1, 1996

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

Deterministic Near-Optimal Controls. Part II: Dynamic Programming and Viscosity Solution Approach

Pages:655–674

Published Online:August 1, 1996

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

The Computation of a Continuum of Constrained Equilibria

Pages:675–696

Published Online:August 1, 1996

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

Compatible Measures and Merging

Pages:697–706

Published Online:August 1, 1996

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

Proximity of Information in Games with Incomplete Information

Pages:707–725

Published Online:August 1, 1996

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

The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games

Pages:726–733

Published Online:August 1, 1996

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

The Modified Nucleolus as Canonical Representation of Weighted Majority Games

Pages:734–756

Published Online:August 1, 1996

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

Computing the Nucleolus by Solving a Prolonged Simplex Algorithm

Pages:757–768

Published Online:August 1, 1996

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

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.