We consider the complexity of stochastic games { simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP \ co-NP.

With the exponential growth of scholarly data during the past few years, effective methods for topic classification are greatly needed. Current approaches usually require large amounts of expensive labeled data in order to make accurate predictions. In this paper, we posit that, in addition to a research article’s textual content, its citation network also contains valuable information. We desc...

The measurement of the J=1–0 line of CO with the IRAM interferometer is reported. The CO line parameters are in good agreement with the result given by Scoville et al. (1993). Thus, CO emission from 3C 48, a radio loud QSO, is definitely detected. The CO emission region is marginally resolved. Source parameters based on the CO line data are discussed.

We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalition to bring about a set of goals depends on whether they are collectively endowed with the necessary resources. We investigate and classify the computational complexity of a number of natural decision problems for CRG...

A comparison between the CO and HI Tully-Fisher relation for a sample of 30 Virgo galaxies shows no significant difference concerning the intrinsic scatter. The distance moduli from both relations after correcting for the sample incompleteness bias agree within the errors and also show no significant difference with previous studies of the Virgo cluster using a complete sample. The CO total lin...

Qualitative coalitional games (QCGs) are a variation of conventional coalitional games in which each coalition may choose to cooperate in a number of different ways, with different choices resulting in potentially different sets of goals being achieved; each agent is associated with a set of goals, the intuition being that an agent is “satisfied” if any of its goals are achieved, but is indiffe...

Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-complete. This hardness remains if P is restricted to be a standard cube and Q is restricted to be the affine image of a cross polytope. While this hardness classification by Freund and Orlin dates back to 1985, there seems to be only limited progress on that problem so far. Based on a formulatio...