Computing the market maker price of a security in a combinatorial prediction market is #P-hard. We devise a fully polynomial randomized approximation scheme (FPRAS) that computes the price of any security in disjunctive normal form (DNF) within an multiplicative error factor in time polynomial in 1/ and the size of the input, with high probability and under reasonable assumptions. Our algorithm...

In this paper, we deal with hypothesis testing for unknown parameters. A new method is proposed based on a combination of the computational approach test and maximum likelihood estimation (CAT-MLE), introduced by [7]. The CAT-MLE does not require any knowledge of the sampling distribution. It depends heavily on numerical computational and Monte-Carlo simulation study. To illustrate the methodol...

Curriculum sequencing is an important technique used in many adaptive hypermedia systems. When following one of the possible page sequences, visiting some pages may become redundant, because its content has been covered already by another page. Using disjunctive and conjunctive prerequisites instead of partial orders to describe the many possible sequences, logical redundancy between pages can ...

In this paper we address the possibility of studying the computational capabilities of catalytic P systems with one catalyst by the means of iterated finite state transducers (IFT). In particular, we focus on a variant of catalytic P systems which satisfies in addition to the original definition the following property: if in a region of the P system an object is the subject of a catalytic rule,...

We investigate a hierarchy Gk (U; S) of classes of conjunctive normal forms, recognizable and SAT-decidable in polynomial time, with special emphasize on the corresponding hardness parameter hU ;S(F) for clause-sets F (the rst level of inclusion). At level 0 an (incomplete, poly-time) oracle U for unsatissability detection and an oracle S for satissability detection is used. The hierarchy from ...