Neurogammon 1.0 is a complete backgammon program which uses multilayer neural networks to make move decisions and doubling decisions. The networks were trained by back-propagation on large expert data sets. Neurogammon appears to play backgammon at a substantially higher level than conventional programs. At the recently held First Computer Olympiad in London, Neurogammon won the backgammon comp...

Hotelling’s (1929) model of duopolistic competition ts re-examined. A family of utility functions is used which has as a special case Hotelling’s original utility function. In a two-stage location-price game it is shown that an equilibrium exists when the curvature of the utility functions in the space of characteristics is sufficiently high. The (subgame-perfect) equilibrium never exhibits min...

An infinite-horizon, stochastic model of entry and exit with sunk costs and imperfect competition is constructed. A subgame perfect Nash equilibrium for the general dynamic stochastic game is shown to exist as a limit of finite-horizon equilibria. This equilibrium has a relatively simple structure characterized by two numbers per finite history. Under very general conditions, it tends to exhibi...

We develop a model of multi-candidate electoral competition in a multi-dimensional policy space with strategic voters. We show that when the distribution of voter ideal points is log-concave, there exist pure-strategy subgame perfect equilibria in weakly undominated strategies in which platforms are located in the minmax set. Analytical and numerical results suggest that the size of the minmax ...

Cryptoprimitives rely on thorough theoretical background, but often lack basic usability features making them prone to unintentional misuse by developers. We argue that this is true even for the state-of-the-art designs. Analyzing 52 candidates of the current CAESAR competition has shown none of them have an avalanche effect in authentication tag strong enough to work properly when partially mi...

It seems that what has been said by now about market and competitiveness do not fit perfectly with competences of getting the best of profit. Sometimes, the classical methods of fundamentals of management do not apply to individual companies that face irregular accommodation on the market. It is high time to replace the perfect business with the right one. New approaches and models may help in ...

Abstract In this paper, we investigate if more competition leads to higher per capita incomes and/or a level of utility in the long run. To end, use Diamond overlapping‐generations model but relaxing assumption perfect good market. We show that weaker unequal distribution income. Surprisingly, note general, tougher does not lead either an increase or nonfirm owners’

Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem, as it implies that every graph G contains a clique of size χ(G), or an odd hole or an odd anti-hole as an induced subgraph. In thi...

We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...

A graph is Berge if no induced subgraph of it is an odd cycle of length at least five or the complement of one. In joint work with Robertson, Seymour, and Thomas we recently proved the Strong Perfect Graph Theorem, which was a conjecture about the chromatic number of Berge graphs. The proof consisted of showing that every Berge graph either belongs to one of a few basic classes, or admits one o...