Page ii
Managing Editors: Panos Pardalos University of Florida, US.A. Reiner Horst University of Trier, Germany Advisory Board: Ding-Thu Du University of Minnesota,...

Page 69
in C. Bandle, J. Bemelmans, M. Chipot, M. Grüter, and J. Saint Jean Paulin (eds.), Progress in partial differential equations:

Page ii
Infanger Stanford University, USA J. Mockus Lithuanian Academy of Sciences, Lithuania PD Panagiotopoulos Aristotle University, Greece HD Sherali Virginia...

Page 167
MICHAEL M. NEUMANN Department of Mathematics and Statistics Mississippi State University Mississippi State, MS 39762, USA e-mail:

Page 174
R is said to be bounded if there exists a constant c such that

Page 257
let C be a nonempty weakly compact convex subset of a Banach space E which has normal structure and let S = {T¿

Page 269
XM Chang and FK Hwang, The minimax number of calls for finite population multi-access channels, in Computer Networking and Performance Evaluation, Ed:...

Page 269
References 1. JI Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inform. Theory 25 (1979), 505-515.

Page 162
Let K be a closed convex cone in the real Hubert space H. Let F be a pseudomonotone mapping from K into H which is continuous on finite-dimensional subspaces

Page 91
Randomization and minimax results are considered for the following type of stochastic two-person zero-sum games: two players sequentially observe a stochastic...