We present a model embodying moderate amounts of nominal rigidities that accounts for the observed inertia in inflation and persistence in output. The key features of our model are those that prevent a sharp rise in marginal costs after an expansionary shock to monetary policy. Of these features

this task more effectively—what is missing from the policies is any direct help with this task. In terms of systems engineering, present policy seems to treat the classroom as a bla k box. Certain inputs from the outside are fed in or make demands—pupils, teachers, other resources, management rules

present value projects. its claim is not credible when cash flow is truly low. Consequently, management is forced to invest too little when cash flow is low and chooses to invest too much when it is high. Financing policies, by influencing the resources under management’s control, can reduce the costs

We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and security credentials, determining whether particular sets of credentials satisfy the relevant policies

Abstract This paper presents a Downsian model of political competition in which parties have incomplete but richer information than voters on policy effects. Each party can observe a private signal of the policy effects, while voters cannot. In this setting, voters infer the policy effects from

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility

and means of translating policy frameworks developed in United Nations conferences and summits into programmes at the country level and, through technical assistance, helps build national capacities. Note The designations employed in this report and the material presented in it do not imply the expression

. We show in this paper how proof-carrying code might be used to develop safe assembly-language extensions of ML programs. In the context of this case study, we present and prove the adequacy of concrete representations for the safety policy, the safety proofs, and the proof validation. Finally, we

devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Configurations are written in a declarative language that supports user-defined abstractions. This language is both readable by humans and easily manipulated by tools. We present

and perspectives adopted in these areas often differ in substantial ways, many planning problems of interest to researchers in these fields can be modeled as Markov decision processes (MDPs) and analyzed using the techniques of decision theory. This paper presents an overview and synthesis of MDP