Generalized correlated equilibrium for two-person games in extensive form with perfect information

A correlation scheme (leading to a special equilibrium called “soft” correlated equilibrium) is applied for two-person finite games in extensive form with perfect information. Randomization by an umpire takes place over the leaves of the game tree. At every decision point players have the choice either to follow the recommendation of the umpire blindly or freely choose any other action except the one suggested. This scheme can lead to Pareto-improved outcomes of other correlated equilibria. Computational issues of maximizing a linear function over the set of soft correlated equilibria are considered and a linear-time algorithm in terms of the number of edges in the game tree is given for a special procedure called “subgame perfect optimization”.

Az ellenzék ereje - általánosított súlyozott szavazási játékok (Minority power - generalized weighted voting games)

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.

Common priors for generalized type spaces

The notion of common prior is well-understood and widely-used in the incomplete information games literature. For ordinary type spaces the common prior is de�fined. Pint�er and Udvari (2011) introduce the notion of generalized type space. Generalized type spaces are models for various bonded rationality issues, for �nite belief hierarchies, unawareness among others. In this paper we de�ne the notion of common prior for generalized types spaces. Our results are as follows: the generalization (1) suggests a new form of common prior for ordinary type spaces, (2) shows some quantum game theoretic results (Brandenburger and La Mura, 2011) in new light.

Generalized type spaces

Ordinary type spaces (Heifetz and Samet, 1998) are essential ingredients of incomplete information games. With ordinary type spaces one can grab the notions of beliefs, belief hierarchies and common prior etc. However, ordinary type spaces cannot handle the notions of finite belief hierarchy and unawareness among others. In this paper we consider a generalization of ordinary type spaces, and introduce the so called generalized type spaces which can grab all notions ordinary type spaces can and more, finite belief hierarchies and unawareness among others. We also demonstrate that the universal generalized type space exists.

Common priors for generalized type spaces

The notion of common prior is well-understood and widely-used in the incomplete information games literature. For ordinary type spaces the common prior is defined. Pinter and Udvari (2011) introduce the notion of generalized type space. Generalized type spaces are models for various bonded rationality issues, for nite belief hierarchies, unawareness among others. In this paper we dene the notion of common prior for generalized types spaces. Our results are as follows: the generalization (1) suggests a new form of common prior for ordinary type spaces, (2) shows some quantum game theoretic results (Brandenburger and La Mura, 2011) in new light.

A kvázi- és általánosított hiperbolikus diszkontálás hosszú távon (Quasi- and Generalized Hyperbolic Discounting in Long Term)

Az intertemporális döntések fontos szerepet játszanak a közgazdasági modellezésben, és azt írják le, hogy milyen átváltást alkalmazunk két különböző időpont között. A közgazdasági modellezésben az exponenciális diszkontálás a legelterjedtebb, annak ellenére, hogy az empirikus vizsgálatok alapján gyenge a magyarázó ereje. A gazdaságpszichológiában elterjedt általánosított hiperbolikus diszkontálás viszont nagyon nehezen alkalmazható közgazdasági modellezési célra. Így tudott gyorsan elterjedni a kvázi-hiperbolikus diszkontálási modell, amelyik úgy ragadja meg a főbb pszichológiai jelenségeket, hogy kezelhető marad a modellezés során. A cikkben azt állítjuk, hogy hibás az a megközelítés, hogy hosszú távú döntések esetén, főleg sorozatok esetén helyettesíthető a két hiperbolikus diszkontálás egymással. Így a hosszú távú kérdéseknél érdemes felülvizsgálni a kvázi-hiperbolikus diszkontálással kapott eredményeket, ha azok az általánosított hiperbolikus diszkontálási modellel való helyettesíthetőséget feltételezték. ____ Intertemporal choice is one of the crucial questions in economic modeling and it describes decisions which require trade-offs among outcomes occurring in different points in time. In economic modeling the exponential discounting is the most well known, however it has weak validity in empirical studies. Although according to psychologists generalized hyperbolic discounting has the strongest descriptive validity it is very complex and hard to use in economic models. In response to this challenge quasi-hyperbolic discounting was proposed. It has the most important properties of generalized hyperbolic discounting while tractability remains in analytical modeling. Therefore it is common to substitute generalized hyperbolic discounting with quasi-hyperbolic discounting. This paper argues that the substitution of these two models leads to different conclusions in long term decisions especially in the case of series; hence all the models that use quasi-hyperbolic discounting for long term decisions should be revised if they states that generalized hyperbolic discounting model would have the same conclusion.

A generalized multidimensional index structure for multimedia data to support content-based similarity searches in a collaborative search environment

Since multimedia data, such as images and videos, are way more expressive and informative than ordinary text-based data, people find it more attractive to communicate and express with them. Additionally, with the rising popularity of social networking tools such as Facebook and Twitter, multimedia information retrieval can no longer be considered a solitary task. Rather, people constantly collaborate with one another while searching and retrieving information. But the very cause of the popularity of multimedia data, the huge and different types of information a single data object can carry, makes their management a challenging task. Multimedia data is commonly represented as multidimensional feature vectors and carry high-level semantic information. These two characteristics make them very different from traditional alpha-numeric data. Thus, to try to manage them with frameworks and rationales designed for primitive alpha-numeric data, will be inefficient. An index structure is the backbone of any database management system. It has been seen that index structures present in existing relational database management frameworks cannot handle multimedia data effectively. Thus, in this dissertation, a generalized multidimensional index structure is proposed which accommodates the atypical multidimensional representation and the semantic information carried by different multimedia data seamlessly from within one single framework. Additionally, the dissertation investigates the evolving relationships among multimedia data in a collaborative environment and how such information can help to customize the design of the proposed index structure, when it is used to manage multimedia data in a shared environment. Extensive experiments were conducted to present the usability and better performance of the proposed framework over current state-of-art approaches.

A generalized adaptive mathematical morphological filter for LIDAR data

Airborne Light Detection and Ranging (LIDAR) technology has become the primary method to derive high-resolution Digital Terrain Models (DTMs), which are essential for studying Earth's surface processes, such as flooding and landslides. The critical step in generating a DTM is to separate ground and non-ground measurements in a voluminous point LIDAR dataset, using a filter, because the DTM is created by interpolating ground points. As one of widely used filtering methods, the progressive morphological (PM) filter has the advantages of classifying the LIDAR data at the point level, a linear computational complexity, and preserving the geometric shapes of terrain features. The filter works well in an urban setting with a gentle slope and a mixture of vegetation and buildings. However, the PM filter often removes ground measurements incorrectly at the topographic high area, along with large sizes of non-ground objects, because it uses a constant threshold slope, resulting in "cut-off" errors. A novel cluster analysis method was developed in this study and incorporated into the PM filter to prevent the removal of the ground measurements at topographic highs. Furthermore, to obtain the optimal filtering results for an area with undulating terrain, a trend analysis method was developed to adaptively estimate the slope-related thresholds of the PM filter based on changes of topographic slopes and the characteristics of non-terrain objects. The comparison of the PM and generalized adaptive PM (GAPM) filters for selected study areas indicates that the GAPM filter preserves the most "cut-off" points removed incorrectly by the PM filter. The application of the GAPM filter to seven ISPRS benchmark datasets shows that the GAPM filter reduces the filtering error by 20% on average, compared with the method used by the popular commercial software TerraScan. The combination of the cluster method, adaptive trend analysis, and the PM filter allows users without much experience in processing LIDAR data to effectively and efficiently identify ground measurements for the complex terrains in a large LIDAR data set. The GAPM filter is highly automatic and requires little human input. Therefore, it can significantly reduce the effort of manually processing voluminous LIDAR measurements.

Examination of the overlap between DSM-111-R overanxious disorder and DSM-IV generalized anxiety disorder in childhood

Since DSM-III-R criteria for Overanxious Disorder (OAD) was subsumed under Generalized Anxiety Disorder (GAD) in DSM-IV, three studies have investigated the overlap between the diagnoses. Although two studies have identified children meeting both OAD and GAD criteria (OAD/GAD group), a third study has identified children who met criteria for OAD, but not GAD (OAD group). Based on finding these two groups of children, we examined whether children in the OAD group (n= 30) could be differentiated from children in the OAD/GAD group (n=81) based on self and parent report of anxious symptoms and level of functional impairment. Conditional probability rates were also calculated for each of the DSM anxious symptoms to determine their overall clinicalutility. Findings revealed that the OAD group of children experienced fewer anxious symptoms than children in the OAD/GAD group, though both groups showed some amount of impairment. The implications for research and practice are discussed.

Generalized atoms in molecules approach (GAIM approach)

This thesis involves two parts. The first is a new-proposed theoretical approach called generalized atoms in molecules (GAIM). The second is a computational study on the deamination reaction of adenine with OH⁻/nH₂O (n=0, 1, 2, 3) and 3H₂O. The GAIM approach aims to solve the energy of each atom variationally in the first step and then to build the energy of a molecule from each atom. Thus the energy of a diatomic molecule (A-B) is formulated as a sum of its atomic energies, EA and EB. Each of these atomic energies is expressed as, EA = Hᴬ + Vₑₑᴬᴬ + 1/2Vₑₑᴬ<>ᴮ EB = Hᴮ + Vₑₑᴮᴮ + 1/2Vₑₑᴬ<>ᴮ where; Hᴬ and Hᴮ are the kinetic and nuclear attraction energy of electrons of atoms A and B, respectively; Vₑₑᴬᴬ and Vₑₑᴮᴮ are the interaction energy between the electrons on atoms A and B, respectively; and Vₑₑᴬ<>ᴮ is the interaction energy between the electrons of atom A with the electrons of atom B. The energy of the molecule is then minimized subject to the following constraint, |ρA(r)dr + |ρB(r)dr = N where ρA(r) and ρB(r) are the electron densities of atoms A and B, respectively, and N is the number of electrons. The initial testing of the performance of GAIM was done through calculating dissociation curves for H₂, LiH, Li₂, BH, HF, HCl, N₂, F₂, and Cl₂. The numerical results show that GAIM performs very well with H₂, LiH, Li₂, BH, HF, and HCl. GAIM shows convergence problems with N₂, F₂, and Cl₂ due to difficulties in reordering the degenerate atomic orbitals Pₓ, Py, and Pz in N, F, and Cl atoms. Further work for the development of GAIM is required. Deamination of adenine results in one of several forms of premutagenic lesions occurring in DNA. In this thesis, mechanisms for the deamination reaction of adenine with OH⁻/nH₂O, (n = 0, 1, 2, 3) and 3H₂O were investigated. HF/6-31G(d), B3LYP/6-31G(d), MP2/6-31G(d), and B3LYP/6-31+G(d) levels of theory were employed to optimize all the geometries. Energies were calculated at the G3MP2B3 and CBS-QB3 levels of theory. The effect of solvent (water) was computed using the polarizable continuum model (PCM). Intrinsic reaction coordinate (IRC) calculations were performed for all transition states. Five pathways were investigated for the deamination reaction of adenine with OH⁻/nH₂O and 3H₂O. The first four pathways (A-D) begin with by deprotonation at the amino group of adenine by OH⁻, while pathway E is initiated by tautomerization of adenine. For all pathways, the next two steps involve the formation of a tetrahedral intermediate followed by dissociation to yield products via a 1,3-hydrogen shift. Deamination with a single OH⁻ has a high activation barrier (190 kJ mol⁻¹ using G3MP2B3 level) for the rate-determining step. Addition of one water molecule reduces this barrier by 68 kJ mol⁻¹ calculated at G3MP2B3 level. Adding more water molecules decreases the overall activation energy of the reaction, but the effect becomes smaller with each additional water molecule. The most plausible mechanism is pathway E, the deamination reaction of adenine with 3H₂O, which has an overall G3MP2B3 activation energy of 139 and 137 kJ mol⁻¹ in the gas phase and PCM, respectively. This barrier is lower than that for the deamination with OH⁻/3H₂O by 6 and 2 kJ mol⁻¹ in the gas phase and PCM, respectively.

Topologies on groups related to the theory of shape and generalized coverings

El presente trabajo consiste en dos partes diferenciadas: la principal de ellas (Cap tulos 1 y 2) est a dedicada a introducir estructura adicional en grupos que aparecen de manera natural en el contexto de la teor a de la forma. En la segunda parte (Cap tulo 3), se plantea c omo generalizar la teor a de espacios recubridores y, en particular, se propone una l nea de trabajo relacionada con la teor a de la forma. El punto de partida de esta tesis doctoral son los trabajos [25, 26, 68, 69, 70] en los que los autores introducen y utilizan algunas ultram etricas en el conjunto de los mor smos shape entre dos espacios topol ogicos punteados. En particular, si el dominio es (S1; 1); la construcci on realizada en [68] permite explicitar una ultram etrica en el grupo shape 1(X; x0) de un espacio m etrico compacto X; como ya fue observado en [69] y [80]. Si el espacio no es m etrico compacto, la construcci on nos lleva a utilizar el concepto de ultram etrica generalizada, en el sentido de Priess-Crampe y Ribenboim [78, 79]. En [7], D. K. Biss introduce la idea de topologizar el grupo fundamental de un espacio, de forma que la topolog a en 1(X; x0) sea una topolog a de grupo que permita detectar la (no) existencia de un recubridor universal para X: La forma de proceder sugerida es tomar en 1(X; x0)la toplog a cociente inducida por la topolog a compacto-abierta en el espacio de lazos (X; x0): Sin embargo, hay algunos errores en el art culo mencionado: en concreto, el error relacionado con el presente trabajo fue puesto de mani esto por P. Fabel en [33], mostrando que, en general, la operaci on de grupo en 1(X; x0)con la topolog a cociente no es continua. Utilizando un punto de vista similar, varios autores han tratado de dotar al grupo fundamental con una topolog a, de forma que 1(X; x0) sea un grupo topol ogico y la proyecci on q (X; x0){u100000} 1(X; x0)sea continua...

Bayesian estimation in generalized autoregressive conditional heteroskedasticity models

Esta tesis doctoral nace con el propósito de entender, analizar y sobre todo modelizar el comportamiento estadístico de las series financieras. En este sentido, se puede afirmar que los modelos que mejor recogen las especiales características de estas series son los modelos de heterocedasticidad condicionada en tiempo discreto,si los intervalos de tiempo en los que se recogen los datos lo permiten, y en tiempo continuo si tenemos datos diarios o datos intradía. Con esta finalidad, en esta tesis se proponen distintos estimadores bayesianos para la estimación de los parámetros de los modelos GARCH en tiempo discreto (Bollerslev (1986)) y COGARCH en tiempo continuo (Kluppelberg et al. (2004)). En el capítulo 1 se introducen las características de las series financieras y se presentan los modelos ARCH, GARCH y COGARCH, así como sus principales propiedades. Mandelbrot (1963) destacó que las series financieras no presentan estacionariedad y que sus incrementos no presentan autocorrelación, aunque sus cuadrados sí están correlacionados. Señaló también que la volatilidad que presentan no es constante y que aparecen clusters de volatilidad. Observó la falta de normalidad de las series financieras, debida principalmente a su comportamiento leptocúrtico, y también destacó los efectos estacionales que presentan las series, analizando como se ven afectadas por la época del año o el día de la semana. Posteriormente Black (1976) completó la lista de características especiales incluyendo los denominados leverage effects relacionados con como las fluctuaciones positivas y negativas de los precios de los activos afectan a la volatilidad de las series de forma distinta.