Learn More
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of unallowable coalitions. Games restricted by a communication graph were introduced by Myerson and Owen. In their model, the feasible coalitions are those that induce connected subgraphs. Another(More)
This paper deals with cooperative games in which only certain coalitions are allowed to form. There have been previous models developed to confront the problem of unallowable coalitions. Games restricted by a communication graph were introduced by Myerson and Owen. In their model, the feasible coalitions are those that induce connected subgraphs. Another(More)
Myerson (1977) used graph-theoretic ideas to analyze cooperation structures in games. In his model, he considered the players in a cooperative game as vertices of a graph, which undirected edges defined their communication possibilities. He modified the initial games taking into account the graph and he established a fair allocation rule based on applying(More)
Fuel cells (FC) are power sources that convert electrochemical energy into electrical energy in a clean and efficient manner. FC technology presents one of the most promising solutions to reduce fossil fuel consumption. FC simulators are expected to play a key role in the development of FC systems due to their low cost and flexibility. This paper presents(More)
A high-frequency digital lock-in amplifier that uses non-uniform sampling is proposed and validated experimentally. By using a random sampling strategy, it is possible to process periodic signals of frequencies several times greater than the Nyquist frequency, which is given by the sampling theorem. The implemented instrument, based on a digital signal(More)
We introduce cooperative TU-games on concept lattices, where a concept is a pair (S, S ′) with S being a subset of players or objects, and S ′ a subset of attributes. Any such game induces a game on the set of players/objects, which appears to be a TU-game whose collection of feasible coalitions is a lattice closed under intersection, and a game on the set(More)
The intention of this article is to introduce a new structure, that we will call decreasing system , which generalize the well-known convex geometries introduced by (PH Edelman, RE Jamison (1985)). We will introduce these structures through the dualization another known structure, augmenting system (Bilbao, 2003). In this article we axiomatize the Shapley(More)
This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting galley proof before it is published in its final citable form. Please note that during the production(More)