This paper provides an elementary, non-technical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub

Xenosaga: Episode 1 are learning machines. They get themselves learned and learned well, so that they get played long and hard by a great many people. This is how they and their designers survive and perpetuate themselves. If a game cannot be learned and even mastered at a certain level, it won’t

performance, initiatives to improve school planning and management, target setting, more frequent and thorough inspection; these are all means to the end. But the sum of all of these doesn’t add up to an effective policy because something is missing. Learning is driven by what teachers and pupils do

been extended and modified. This executable semantics has been in operation in driving the simulation, dynamic tests, and code generation tDols of STATEMATE since 1987, and a technical report describing it has been available from i-Logix, Inc. since 1989. We have now decided to revise and publish

Inflation targeting is shown to imply inflation forecast targeting: the central bank's inflation forecast becomes an explicit intermediate target. Inflation forecast targeting simplifies both implementation and monitoring of monetary policy. The weight on output stabilization determines how quickly the inflation forecast is adjusted towards the inflation target. Money growth or exchange rate targeting is generally inferior than inflation targeting and leads to higher inflation variability. Commitment to `target rules' may be better than commitment to `instrument rules'.

Abstract not found

ABSTRACT Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpomt semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational semantics is a part of proof theory and that fixpolnt semantics is a special case of model-theoret:c semantics KEY WORDS AND PHRASES predicate logic as a programming language, semantics of programming languages, resolution theorem proving, operaUonal versus denotatlonal semantics, SL-resoluuon, flxpomt characteriza-tion

A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method is applied to a molecular dynamics simulation of a liquid of 64 n-butane molecules and compared to a simulation using generalized coordinates. The method should be useful for molecular dynamics calculations on large molecules with internal degrees of freedom. 1. INTR~D~JCTI~N The method of molecular dynamics (MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical model, (b) the derivation of the equations of motion of the system and (c) the choice of an efficient algorithm for the numerical integration of these equations. In polyatomic molecules, the fast internal vibrations are usually decoupled from

Abstract not found

Abstract not found