In a recent paper, this author studied invariant ideals in abelian group algebras under the action of certain infinite, locally finite, quasi-simple groups. While the main result was reasonably definitive, there are nevertheless certain natural extensions that should be considered. One approach to a proof of such extensions is to improve the basic tools that were used in the original work. Howe...

This paper presents and discusses a novel approach to indeterministic belief revision. An indeterministic belief revision operator assumes that, when an agent is confronted with a new piece of information, it can revise its belief sets in more than one way. We define a rational agent not only in terms of what it believes but also of what it desires and wants to achieve. Hence, we propose that t...

The theory of moduli of morphisms on P generalizes the study of rational maps on P1. This paper proves three results about the space of morphisms on P of degree d > 1, and its quotient by the conjugation action of PGL(n + 1). First, we prove that this quotient is geometric, and compute the stable and semistable completions of the space of morphisms. This strengthens previous results of Silverma...

We present a rational analysis of curiosity, proposing that people’s curiosity is driven by seeking stimuli that maximize their ability to make appropriate responses in the future. This perspective offers a way to unify previous theories of curiosity into a single framework. Experimental results confirm our model’s predictions, showing how the relationship between curiosity and confidence can c...

We argue that none of the existing epistemic logics can adequately serve the needs of agent theories. We suggest a new concept of knowledge which generalizes both implicit and explicit knowledge and argue that this is the notion we need to formalize agents in Distributed Arti cial Intelligence. A logic of the new concept is developed which is formally and practically adequate in the following s...

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple computation of the value of words in this system and easy constructions for the recognition of recognisable sets of numbers. It is also shown that conversely...

The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

Rational proofs, introduced by Azar and Micali (STOC 2012), are a variant of interactive proofs in which the prover is rational, and may deviate from the protocol for increasing his reward. Guo et al. (ITCS 2014) demonstrated that rational proofs are relevant to delegation of computation. By restricting the prover to be computationally bounded, they presented a one-round delegation scheme with ...