Kernels of compound games with simple components
نویسندگان
چکیده
منابع مشابه
Kernels of Compound Games with Simple Components
The kernel is a solution concept for a cooperative game. It reflects symmetry properties of the characteristic function and desirability relations over the set of the players. Given m games over disjoint sets of players and an m-person game,one defines a compound game over the union of the m disjoint sets. These m games are the components and the above rnperson game is called the quotient. The ...
متن کاملSimple Coalitional Games with Beliefs
We introduce coalitional games with beliefs (CGBs), a natural generalization of coalitional games to environments where agents possess private beliefs regarding the capabilities (or types) of others. We put forward a model to capture such agent-type uncertainty, and study coalitional stability in this setting. Specifically, we introduce a notion of the core for CGBs, both with and without coali...
متن کاملCompound analysis via graph kernels incorporating chirality.
High accuracy is paramount when predicting biochemical characteristics using Quantitative Structural-Property Relationships (QSPRs). Although existing graph-theoretic kernel methods combined with machine learning techniques are efficient for QSPR model construction, they cannot distinguish topologically identical chiral compounds which often exhibit different biological characteristics. In this...
متن کاملkFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FOIL with kernel methods. The feature space is constructed by leveraging FOIL search for a set of relevant clauses. The search is driven by the performance obtained by a support vector machine based on the resulting kern...
متن کاملSimple randomized algorithms for online learning with kernels
In online learning with kernels, it is vital to control the size (budget) of the support set because of the curse of kernelization. In this paper, we propose two simple and effective stochastic strategies for controlling the budget. Both algorithms have an expected regret that is sublinear in the horizon. Experimental results on a number of benchmark data sets demonstrate encouraging performanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1974
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1974.50.531