
19651973 Senior Mathematician,
Israel Aircraft Industries.


19701973 Instructor, Dept. of
,statistics, Tel Aviv University.

19731975 Senior Lecturer
(adjunct), Dept. of Statistics, University of Haifa.

19771978 Visiting Scientist, IBM
T.J. Watson Research Center Yorktown Heights, N.Y., U.S.A.

19801991
Adjunct Senior Teaching Fellow, Technion, Haifa, Israel.


19731997
Research Staff Member and Program Manager Operations
Research, IBM Israel
Science and Technology.

19951998 Chairman, Dept. of
Statistics, University of Haifa.

1994present
Professor, Dept. of Statistics, University of Haifa.

Papers:

S. Alpern and S. Gal, "A Mixed Strategy Minimax Theorem
without Compactness", SIAM J. Control and Optimization,
Vol. 26,(1988) 13571361.

S. Gal, "Continuous Search Games", Chapter 3 of
SEARCH THEORY: Some Recent Developments, D. V. Chudnovsky and G.
V. Chudnovsky (eds.), Marvel Dekker, 1989, pp. 3353.
 S. Gal, ''The Parameter
Iteration Method in Dynamic Programming'', Management Science,
V. 35 No. 6, (1989) 675684.

S. Gal and E. J. Anderson, "Search in a Maze", Probability in
the Engineering and Informational Sciences, 4 (1990) 311318.
 S. Gal and Boris Bachelis, ''An
Accurate Elementary Mathematical Library for the IEEE Floating
point Standard'', ACM Trans. Math. Software, Vol. 17 No. 1
(1991) pp. 2645.

S. Gal and D. Sheinwald, "Optimal Sampling for Finding a
Cluster: an Application in Sorting", 1992, Probability in
the Engineering and Informational Sciences, 7 (1993) 387407.
 S. Gal, Y. Hollander and A.
Itai, ''Optimal Mapping in Direct Mapped Cache Environment'',
Mathematical Programming 63 (1994) 371387.
 S. Gal and B. Klots, ''Optimal
Partitioning which Maximizes the Sum of the Weighted Averages'',
OPERATIONS RESEARCH, 43 (1995) 500508.

S. Alpern and S. Gal, "Rendezvous Search on the Line with
Distinguishable Players", SIAM J. Control and
Optimization, 33 (1995) 12701276.
 D. Bernstein, S. Gal and M.
Rodeh, ''Mathematical Analysis of using Statistical Sampling for
Estimating Computer Cache Performance'', Stochastic Models, 12
(1996) 6775.

V. Baston and S. Gal, "Rendezvous on the line when the players'
initial distance is given by an unknown probability
distribution", SIAM J. Control and Optimization, 36 (1998)
18801889.

S. Gal, "Rendezvous search on the line", OPERATIONS RESEARCH, 47
(1999) 974976.
 S. Gal, "On the Optimality of a
Simple Strategy for Searching Graphs", Int. J. Game Theory 29
(2001) 533542.
 V. Baston and S. Gal,
"Rendezvous Search when Marks are left at the Starting Points",
Naval Res. Log. 48 (2001) 722731.
 S. Alpern and S. Gal,
"Searching for an Agent who may or may not Want to be Found",
OPERATIONS RESEARCH 50 ( 2002) 311323.
 S. Gal and J. Howard,
"Rendezvousevasion search in two boxes ", OPERATIONS RESEARCH
53 (2005) 689697.

E. Demaine, S. Fekete, and S. Gal, "Online Searching with Turn
Cost", Theoretical Computer Science 361 (2006) 342355.

S. Gal, M. Landsberger and A. Nemirovski, "Participation in
auctions",
GAMES and ECONOMIC BEHAVIOR 60 (2007) 75103.
 A. Dagan and S. Gal, "Networks
Search Games with Arbitrary searcher starting point", NETWORKS
Vol. 52 (2008) 156161.
 A. Alpern, V. Baston and S.
Gal, "Network Search Games with an immobile hider without a
designated searcher starting point", Int. J. Game Theory 37
(2008) 281302.
 S. Alpern, V. Baston and S.
Gal, "Searching symmetric networks with UtalitarianPostman
paths", NETWORKS Vol 53. (2009) 393402.
 S. Alpern and S. Gal, "Analysis
and design of selection committees: a game theoretic secretary
problem, Int. J. Game Theory 38 (2009) 377394.
 S. Alpern, S. Gal, and E.
Solan, "A sequential selection game with Vetoes". GAMES and
ECONOMIC BEHAVIOR 68 (2010) 114.
 S. Gal, "Search games" . Wiley
Encyclopedia of Operations Research and Management Sci. (James
J. Cochran, ed.), Wiley, 2011.

Alpern, S.; Fokkink, R.;
Gal, S.; Timmer, M. "On search
games that include ambush". SIAM J. Cont. and Optimization 51
(2013) 45444556.

S. Gal and J. Casas.
"Succession of Hideseek and pursuitevasion at heterogenous
locations". Journal of the Royal Society Interface. 2014.

S Gal, S Alpern, J Casas  "Prey should hide more
randomly
when a predator attacks more persistently". Journal of The Royal
Society Interface, 2015.

Book Chapters:
 S. Gal, Strategies for
Searching Graphs, in GRAPH THEORY, COMBINATORICS AND
ALGORITHMS, M.C. Golumbic and I. BenAroyo Hartman (ed),
Springer 2005, 189214.
 S. Gal, Search GamesA
review, in SEARCH THEORY: A GAME
THEORETIC PERSPECTIVE. Steve Alpern, Robbert Fokkink,
Leszek Ga˛sieniec, Roy Lindelauf, VS Subrahmanian (eds),
Springer 2013, 315.
