Suchergebnisse

"It can be advantageous for an office motivated party A to spend effort to make it public that a group of voters will lose from party A's policy proposal. Such effort is called inverse campaigning. The inverse campaigning equilibria are described for the case where the two parties can simultaneously reveal information publicly to uninformed voters. Inverse campaigning dissipates the parties' rents and causes some inefficiency in expectation. Inverse campaigning also influences policy design. Successful policy proposals hurt small groups of voters who lose much and do not benefit small groups of voters who win much." (author's abstract)

It can be advantageous for an office motivated party A to spend effort to make it public that a group of voters will lose from party A's policy proposal. Such effort is called inverse campaigning. The inverse campaigning equilibria are described for the case where the two parties can simultaneously reveal information publicly to uninformed voters. Inverse campaigning dissipates the parties' rents and causes some inefficiency in expectation. Inverse campaigning also influences policy design. Successful policy proposals hurt small groups of voters who lose much and do not benefit small groups of voters who win much. ; Die Arbeit untersucht die Anreize von politischen Parteien (oder Kandidaten), Wähler oder Wählergruppen und die Öffentlichkeit gezielt über die Wirkung der konkurrierenden Wahlprogramme zu informieren. In der Arbeit wird gezeigt, dass es für eine Partei A vorteilhaft sein kann, öffentlich darüber zu informieren, dass eine bestimmte Wählergruppe Nachteile erleidet, wenn das Programm der Partei A umgesetzt wird. Solche Informationsaktivitäten werden inverse campaigning genannt. Die Arbeit bestimmt die Gleichgewichte, in denen die konkurrierenden Parteien beide inverse campaigning betreiben, und bestimmt die Wohlfahrtsverluste, die durch diese Aktivitäten verursacht werden. Ferner werden die Konsequenzen aus diesen Aktivitäten für den Zuschnitt erfolgreicher Wahlprogramme beschrieben.

1593 1605 66 8 ; S ; [EN] Let R be a unital ring with involution. In Section 2, for given two core invertible elements a, b. R, we investigate mainly the absorption law for the core inverse in virtue of the equality of the projections aa and .In Section 3, we study several relations concerning the projections a a and bb , where a . a{1, 2, 4} and b . b{1, 2, 3}. Some well- known results are extended to the *- reducing ring case. As an application, EP elements in a *- reducing ring are considered. This research was supported by the National Natural Science Foundation of China [grant number 11371089]. The first author is grateful to China Scholarship Councilor giving him a scholarship for his further study in Universitat Politecnica de Valencia Spain. Xu, S.; Chen, C.; Benítez López, J. (2018). Projections for generalized inverses. Linear and Multilinear Algebra. 66(8):1593-1605. https://doi.org/10.1080/03081087.2017.1364339

According to previous literature, we define randomized inverse sampling for comparing two treatments with respect to a binary response as the sampling that stops when a total fixed number of successes, irrespective of the treatments, are observed. We have obtained elsewhere the asymptotic distributions for the counting variables involved and have shown them to be equivalent to the corresponding asymptotic distributions for multinomial sampling. In this paper, we start deriving the same basic results using different techniques, and we then show how they give rise to genuinely novel procedures when translated into finite sample approximations. As the main example, a novel confidence interval for the logarithm of the odds ratio of two success probabilities can be constructed in the case of comparative randomized inverse sampling. Some advantages over the standard multinomial sampling in terms of coverage probabilities are visible when no adjustment for cells with zero counts is applied; otherwise, the two sampling schemes appear to be fairly equivalent. This is a reassurance that under certain circumstances, inverse sampling can be safely chosen over more traditional sampling schemes.

"Starting with the classical, the modified and the iterative Shepard methods, we construct some new Shepard type operators, using the inverse quadratic and the inverse multiquadric radial basis functions. Given some sets of points, we compute some representative subsets of knot points following an algorithm described by J.R. McMahon in 1986."