We consider a general model of the non-cooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good

In this paper we study both market risks and nonmarket risks, without complete markets assumption, and discuss methods of measurement of these risks. We present and justify a set of four desirable properties for measures of risk, and call the measures satisfying these properties “coherent.” We

The purpose of this paper is twofold. The first is to challenge the assump-tions regarding knowledge completeness that planning agents are often taken as possessing, and the solutions to the frame problem that depend upon these assumptions. The second is to present preliminary ideas regarding an

for costly punishment causes a large increase in cooperation levels because potential free riders face a credible threat. We show, in particular, that in the presence of a costly punishment opportunity almost complete cooperation can be achieved and maintained although, under the standard assumptions

or information redundancy between the image intensities of corresponding voxels in both images, which is assumed to be maximal if the images are geometrically aligned. Maximization of MI is a very general and powerful criterion, because no assumptions are made regarding the nature of this dependence

The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory

out each arm to find the best one) and exploitation (playing the arm believed to give the best payoff). Past solutions for the bandit problem have almost always relied on assumptions about the statistics of the slot machines. In this work, we make no statistical assumptions whatsoever about the nature

of type correctness. For expository purposes and due to space limitation, we chose to make a number of simplifying assumptions and left some features out. A more complete account can be found in [KSK92].

believed assumptions, DLP is strictly more expressive than normal (disjunction-free) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing

Abstract—This paper presents a new model of an artificial immune network which is strongly based on the repertoire completeness assumption. The model is different from previous approaches in that it eliminates the genetic search achieved by most of the current immune network models. Instead