Proof of Proposition 1: The off-equilibrium path beliefs imply that any price offer below M(w) is definitely rejected, and any price offer above M(w̄) is definitely accepted. Any price offer v between M(w) and M(w̄) leads F to believe that w = M−1(v), and he is indifferent between accepting and rejecting it, making it optimal for him to randomize his acceptance decision. Finally, when the randomi...

This paper presents the results of the analysis of 56,000 flat grids in a form suitable for minimum weight design.

A minimal sufficient condition for global optimality involving the Darboux point, analogous to the minimal sufficient condition of local optimality involving the conjugate point, is presented. The Darboux point is then characterized for optimal control problems with linear dynamics, cost functionals with a general terminal state term and an integrand quadratic in the state and control, and gene...

This paper gives sufficient conditions for a class of bang-bang extremals with multiple switches to be locally optimal in the strong topology. The conditions are the natural generalizations of the ones considered in [5, 13] and [16]. We require both the strict bang-bang Legendre condition, and the second order conditions for the finite dimensional problem obtained by moving the switching times ...

Coevolution is a powerful tool in evoltionary computing that mitigate some of its endemic problems, namely stagnation in local optima and lack of convergence in high dimensionality problems. Since its inception in 1990, there are multiple articles that have contributed greatly to the development and improvement of the coevolutionary techniques. In this report we review some of those landmark ar...

This paper proposes two new approaches to rapid speaker adaptation of acoustic models by using genetic algorithms. Whereas conventional speaker adaptation techniques yield adapted models which represent local optimum solutions, genetic algorithms are capable to provide multiple optimal solutions, thereby delivering potentially more robust adapted models. We have investigated two different strat...

This paper argues that non-colluding price setting firms in an uncertain economic environment will set a ‘low’ markup relative to the profit maximising markup if; (a) they are uncertain of the profit maximising markup; and (b) the cost to firms of mistakenly setting a ‘high’ markup is greater than if they mistakenly set a ‘low’ markup. Furthermore, firms will set a lower markup the higher is th...

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventor y literature studies continuo us approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that these properties no longer hold in the discrete space, in the sense of linear interpolation extensio n...

We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution” by walking on the surface of the Minkowski sums. The surface of the Minkowski sums is computed implicitly by constructing a local Gauss map. In practice, the algorithm works well when there is high motion coherence in the environmen...

We show the highly non–surprising fact that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. This gives a first example of a locally optimal lattice covering having a non–simplicial Delone subdivision. Hereby, we in particular answer a question of Dickson posed in 1968. By showing that the Leech lattice is rigid, our answer is even strongest possib...