Miklós Pintér

Integrative analysis of neuroblastoma and pheochromocytoma genomics data

BackgroundPheochromocytoma and neuroblastoma are the most common neural crest-derived tumors in adults and children, respectively. We have performed a large-scale in silico analysis of altogether 1784 neuroblastoma and 531 pheochromocytoma samples to establish similarities and differences using analysis of mRNA and microRNA expression, chromosome aberrations and a novel bioinformatics analysis based on cooperative game theory.MethodsDatasets obtained from Gene Expression Omnibus and ArrayExpress have been subjected to a complex bioinformatics analysis using GeneSpring, Gene Set Enrichment Analysis, Ingenuity Pathway Analysis and own software.ResultsComparison of neuroblastoma and pheochromocytoma with other tumors revealed the overexpression of genes involved in development of noradrenergic cells. Among these, the significance of paired-like homeobox 2b in pheochromocytoma has not been reported previously. The analysis of similar expression patterns in neuroblastoma and pheochromocytoma revealed the same anti-apoptotic strategies in these tumors. Cancer regulation by stathmin turned out to be the major difference between pheochromocytoma and neuroblastoma. Underexpression of genes involved in neuronal cell-cell interactions was observed in unfavorable neuroblastoma. By the comparison of hypoxia- and Ras-associated pheochromocytoma, we have found that enhanced insulin like growth factor 1 signaling may be responsible for the activation of Src homology 2 domain containing transforming protein 1, the main co-factor of RET. Hypoxia induced factor 1α and vascular endothelial growth factor signaling included the most prominent gene expression changes between von Hippel-Lindau- and multiple endocrine neoplasia type 2A-associated pheochromocytoma.ConclusionsThese pathways include previously undescribed pathomechanisms of neuroblastoma and pheochromocytoma and associated gene products may serve as diagnostic markers and therapeutic targets.

Young's axiomatization of the Shapley value - a new proof

We give a new proof of Young’s characterization of the Shapley value. Moreover, as applications of the new proof, we show that Young’s axiomatization of the Shapley value is valid on various well-known subclasses of

Properties and comparison of risk capital allocation methods

\textit{TU}

The Shapley value for shortest path games: a non-graph-based approach

TU games.

The Shapley Value for Airport and Irrigation Games

We generalize exactness to games with non-transferable utility (NTU). A game is exact if for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We consider five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unified under NTU exactness. We provide an example of a cardinally convex game which is not NTU exact. Finally, we relate the classes of [Pi]-balanced, totally [Pi]-balanced, NTU exact, totally NTU exact, ordinally convex, cardinally convex, coalition merge convex, individual merge convex and marginal convex games to one another.

The non-existence of a universal topological type space

If a financial unit (a bank, an insurance company, a portfolio, the financial system of a country, etc.) consists of subunits (divisions, subportfolios, etc.), then the risk of the main unit should be allocated to the subunits using a risk capital allocation method in a fair way.

Type space on a purely measurable parameter space

Meier (2008) shows that the universal knowledge-belief space exists. However, besides the universality there is an other important property might be imposed on knowledge-belief spaces, inherited also from type spaces, the completeness. In this paper we introduce the notion of complete knowledge-belief space, and demonstrate that the universal knowledge-belief space is not complete, that is, some subjective beliefs (probability measures) on the universal knowledge-belief space are not knowledge-belief types.

The existence of an inverse limit of an inverse system of measure spaces — A purely measurable case

The shortest path games are considered in this paper. The transportation of a good in a network has costs and benefits. The problem is to divide the profit of the transportation among the players. Fragnelli et al. (Math Methods Oper Res 52: 251–264, 2000) introduce the class of shortest path games and show it coincides with the class of monotone games. They also give a characterization of the Shapley value on this class of games. In this paper we consider further five characterizations of the Shapley value (Hart and Mas-Colell’s in Econometrica 57:589–614, 1989; Shapley’s in Contributions to the theory of games II, annals of mathematics studies, vol 28. Princeton University Press, Princeton, pp 307–317, 1953; Young’s in Int J Game Theory 14:65–72, 1985, Chun’s in Games Econ Behav 45:119–130, 1989; van den Brink’s in Int J Game Theory 30:309–319, 2001 axiomatizations), and conclude that all the mentioned axiomatizations are valid for the shortest path games. Fragnelli et al. (Math Methods Oper Res 52:251–264, 2000)’s axioms are based on the graph behind the problem, in this paper we do not consider graph specific axioms, we take