5 resultados para Weighted shift
em Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest
Resumo:
Probability density function (pdf) for sum of n correlated lognormal variables is deducted as a special convolution integral. Pdf for weighted sums (where weights can be any real numbers) is also presented. The result for four dimensions was checked by Monte Carlo simulation.
Resumo:
A hagyományos szavazási játékok speciális átruházható hasznosságú, kooperatív játékok, úgynevezett egyszerű játékok, ahol a játékosok a pártok, és az egyes koalíciók értéke 1 vagy 0 attól függően, hogy az adott koalíció elég erős-e az adott jogszabály elfogadásához, vagy sem. Ebben a cikkben bevezetjük az általánosított súlyozott szavazási játékok fogalmát, ahol a pártok mandátumainak száma a valószínűségi változó. Magyar példákon keresztül mutatjuk be az új megközelítés használhatóságát. / === / Voting games are cooperative games with transferable utility, so-called simple games, where the players are parties and the value of a coalition may be 0 or 1 depending on its ability to pass a new law. The authors introduce the concept of generalized weighted voting games where the parties' strengths are random variables. taking examples from Hungary to illustrate the use of this approach.
Resumo:
It is important to the landscape architects to become acquainted with the results of the regional climate models so they can adapt to the warmer and more arid future climate. Modelling the potential distribution area of certain plants, which was the theme of our former research, can be a convenient method to visualize the effects of the climate change. A similar but slightly better method is modelling the Moesz-line, which gives information on distribution and usability of numerous plants simultaneously. Our aim is to display the results on maps and compare the different modelling methods (Line modelling, Distribution modelling, Isotherm modelling). The results are spectacular and meet our expectations: according to two of the three tested methods the Moesz-line will shift from South Slovakia to Central Poland in the next 60 years.
Resumo:
We consider linearly weighted versions of the least core and the (pre)nucleolus and investigate the reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if the core of the game is not empty, all dually inessential coalitions (which can be weakly minorized by a partition in the dual game) can be ignored when we compute the per-capita least core and the per-capita (pre)nucleolus from the dual game. This could lead to the design of polynomial time algorithms for the per-capita (and other monotone nondecreasingly weighted versions of the) least core and the (pre)nucleolus in specific classes of balanced games with polynomial many dually esential coalitions.