Crop decision planning is an important part of effective farm management. Because of the many uncertain factors such as weather variations, technology advances, and crop yields and prices, all of which prove to change considerably, decision planning can be very complex. The focus of this paper is to develop accurate yield and price forecasting models to aid in decision planning. For yield forec...

The stochastic population dynamics model used by Aboriginal Whaling Management Procedure developers is revised to correct weaknesses related to uncertainty parameterisation and replacement yield estimation. Two variants of this model, along with the standard determinis-tic version, are used to assess the Bering-Chukchi-Beaufort Seas stock of bowhead whales. The variants diier with respect to th...

Optimal trajectories of deterministic systems satisfy Pontryagin’s maximum principle and can be computed efficiently. Related results for stochastic systems exist but they lack the simplicity and computational efficiency of the deterministic case. Here we show that a certain class of both discrete-time and continuous-time nonlinear stochastic control problems obey a classic maximum principle, i...

We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints. Many wellstudied problems like online stochastic packing and covering, online stochastic matching with concave returns, etc. form a special case of online stochastic CP. We present fast algorithms f...

Decision making plays an important role in economics, psychology, philosophy, mathematics, statistics and many other fields. In each field, decision making consists of identifying the values, uncertainties and other issues that define the decision. In any field, the nature of the decisions is affected by environmental characteristics. In this paper, we are considered the production planning pro...

A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with ω-regular winning conditions specified as Rabin or Streett objectives. These games are NP-complete and coNP-complete, respectively. The value of the game for a player at a state s given an objective Φ is the maximal probability that the player can guarantee th...