3,266 research outputs found
Players Indifferent to Cooperate and Characterizations of the Shapley Value
In this paper we provide new axiomatizations of the Shapley value for TU-games using axioms that are based on relational aspects in the interactions among players. Some of these relational aspects, in particular the economic or social interest of each player in cooperating with each other, can be found embedded in the characteristic function. We define a particular relation among the players that it is based on mutual indifference. The first newaxiom expresses that the payoffs of two playerswho are not indifferent to each other are affected in the same way if they become enemies and do not cooperate with each other anymore. The second new axiom expresses that the payoff of a player is not affected if players to whom it is indifferent leave the game. We show that the Shapley value is characterized by these two axioms together with the well-known efficiency axiom. Further, we show that another axiomatization of the Shapley value is obtained if we replace the second axiom and efficiency by the axiom which applies the efficiency condition to every class of indifferent players. Finally, we extend the previous results to the case of weighted Shapley values. © Springer-Verlag Berlin Heidelberg 2012
Minimal H\"older regularity implying finiteness of integral Menger curvature
We study two families of integral functionals indexed by a real number . One family is defined for 1-dimensional curves in and the other one
is defined for -dimensional manifolds in . These functionals are
described as integrals of appropriate integrands (strongly related to the
Menger curvature) raised to power . Given we prove that
regularity of the set (a curve or a manifold), with implies finiteness of both curvature functionals
( in the case of curves). We also show that is optimal by
constructing examples of functions with graphs of infinite
integral curvature
A value for directed communication situations
In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the players enter the coalition. Therefore, we model the communication network by a directed graph and the cooperative game by a generalized characteristic function as introduced in Nowak and Radzik (1994). We generalize the Myerson value for undirected (or standard) communication situations to the context of directed communication and provide two axiomatizations of this digraph Myerson value using component efficiency and either fairness or the balanced contributions property
Mobile Robot Object Recognition through the Synergy of Probabilistic Graphical Models and Semantic Knowledge
J.R. Ruiz-Sarmiento and C. Galindo and J. Gonzalez-Jimenez, Mobile Robot Object Recognition through the Synergy of Probabilistic Graphical Models and Semantic Knowledge, in European Conf. of Artificial Intelligence, CogRob workshop, 2014.Mobile robots intended to perform high-level tasks have to recognize objects in their workspace. In order to increase the success of the recognition process, recent works have studied the use of contextual information. Probabilistic Graphical Models (PGMs) and Semantic Knowledge (SK) are two well-known approaches for dealing with contextual information, although they exhibit some drawbacks: the PGMs complexity exponentially increases with the number of objects in the scene, while SK are unable to handle uncertainty. In this work we combine both approaches to address the object recognition problem. We propose the exploitation of SK to reduce the complexity of the probabilistic inference, while we rely on PGMs to enhance SK with a mechanism to manage uncertainty. The suitability of our method is validated through a set of experiments, in which a mobile robot endowed with a Kinect-like sensor captured 3D data from 25 real environments, achieving a promising result of ~94% of success.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. This work has been funded by the Spanish grant program FPU-MICINN 2010 and the Spanish project "TAROTH: New developments toward a robot at home"
Cup products on polyhedral approximations of 3D digital images
Let I be a 3D digital image, and let Q(I) be the associated cubical complex. In this paper we show how to simplify the combinatorial structure of Q(I) and obtain a homeomorphic cellular complex P(I) with fewer cells. We introduce formulas for a diagonal approximation on a general polygon and use it to compute cup products on the cohomology H *(P(I)). The cup product encodes important geometrical information not captured by the cohomology groups. Consequently, the ring structure of H *(P(I)) is a finer topological invariant. The algorithm proposed here can be applied to compute cup products on any polyhedral approximation of an object embedded in 3-space
Atmospheric Neutrino Oscillations and New Physics
We study the robustness of the determination of the neutrino masses and
mixing from the analysis of atmospheric and K2K data under the presence of
different forms of phenomenologically allowed new physics in the nu_mu--nu_tau
sector. We focus on vector and tensor-like new physics interactions which allow
us to treat, in a model independent way, effects due to the violation of the
equivalence principle, violations of the Lorentz invariance both CPT conserving
and CPT violating, non-universal couplings to a torsion field and non-standard
neutrino interactions with matter. We perform a global analysis of the full
atmospheric data from SKI together with long baseline K2K data in the presence
of nu_mu -> nu_tau transitions driven by neutrino masses and mixing together
with sub-dominant effects due to these forms of new physics. We show that
within the present degree of experimental precision, the extracted values of
masses and mixing are robust under those effects and we derive the upper bounds
on the possible strength of these new interactions in the nu_mu--nu_tau sector.Comment: 22 pages, LaTeX file using RevTEX4, 5 figures and 4 tables include
Neutrinos in Non-linear Structure Formation - a Simple SPH Approach
We present a novel method for implementing massive neutrinos in N-body
simulations. Instead of sampling the neutrino velocity distribution by
individual point particles we take neutrino free-streaming into account by
treating it as an effective redshift dependent sound speed in a perfect
isothermal fluid, and assume a relation between the sound speed and velocity
dispersion of the neutrinos. Although the method fails to accurately model the
true neutrino power spectrum, it is able to calculate the total matter power
spectrum to the same accuracy as more complex hybrid neutrino methods, except
on very small scales. We also present an easy way to update the publicly
available Gadget-2 version with this neutrino approximation.Comment: 13 pages, 7 figure
Protein sequence and structure: Is one more fundamental than the other?
We argue that protein native state structures reside in a novel "phase" of
matter which confers on proteins their many amazing characteristics. This phase
arises from the common features of all globular proteins and is characterized
by a sequence-independent free energy landscape with relatively few low energy
minima with funnel-like character. The choice of a sequence that fits well into
one of these predetermined structures facilitates rapid and cooperative
folding. Our model calculations show that this novel phase facilitates the
formation of an efficient route for sequence design starting from random
peptides.Comment: 7 pages, 4 figures, to appear in J. Stat. Phy
Connectivity forests for homological analysis of digital volumes
In this paper, we provide a graph-based representation of the homology (information related to the different “holes” the object has) of a binary digital volume. We analyze the digital volume AT-model representation [8] from this point of view and the cellular version of the AT-model [5] is precisely described here as three forests (connectivity forests), from which, for instance, we can straightforwardly determine representative curves of “tunnels” and “holes”, classify cycles in the complex, computing higher (co)homology operations,... Depending of the order in which we gradually construct these trees, tools so important in Computer Vision and Digital Image Processing as Reeb graphs and topological skeletons appear as results of pruning these graphs
Ground-state properties of tubelike flexible polymers
In this work we investigate structural properties of native states of a
simple model for short flexible homopolymers, where the steric influence of
monomeric side chains is effectively introduced by a thickness constraint. This
geometric constraint is implemented through the concept of the global radius of
curvature and affects the conformational topology of ground-state structures. A
systematic analysis allows for a thickness-dependent classification of the
dominant ground-state topologies. It turns out that helical structures,
strands, rings, and coils are natural, intrinsic geometries of such tubelike
objects
- …
