14,506 research outputs found

    Strategy-proof coalition formation

    Get PDF
    We analyze coalition formation problems in which a group of agents is partitioned into coalitions and agents' preferences only depend on the coalition they belong to. We study rules that associate to each profile of agents' preferences a partition of the society. We focus on strategyproof rules on restricted domains of preferences, as the domains of additively representable or separable preferences. In such domains, only single-lapping rules satisfy strategy-proofness, individual rationality, non-bossiness, and flexibility. Single-lapping rules are characterized by severe restrictions on the set of feasible coalitions. These restrictions are consistent with hierarchical organizations and imply that single-lapping rules always select core-stable partitions. Thus, our results highlight the relation between the non-cooperative concept of strategy-proofness and the cooperative concept of core-stability. We analyze the implications of our results for matching problem

    Strategy-Proof Coalition Formation

    Get PDF
    We analyze coalition formation problems in which a group of agents is partitioned into coalitions and agents' preferences only depend on the coalition they belong to. We study rules that associate to each profile of agents' preferences a partition of the society. We focus on strategy-proof rules on restricted domains of preferences, as the domains of additively representable or separable preferences. In such domains, the only strategy-proof and individually rational rules that satisfy either Pareto efficiency or non-bossiness and flexibility are single-lapping rules. Single-lapping rules are characterized by severe restrictions on the set of feasible coalitions that are consisitent with hierarchical organizations. These restrictions are necessary and sufficient for the existence of a unique core-stable partition. This fact implies that single-lapping rules always select the associated unique core-stable partition. Thus, our results highlight the relation between the non-cooperative concept of strategy-proofness and the cooperative concept of uniqueness of core-stable partitions.Coalition Formation; Strategy-Proofness; Single-Lapping Property; Core-Stability; Matching Problems.

    Strategy-proof coalition formation.

    Get PDF
    We analyze coalition formation problems in which a group of agents is partitioned into coalitions and agents' preferences only depend on the coalition they belong to. We study rules that associate to each profile of agents' preferences a partition of the society. We focus on strategyproof rules on restricted domains of preferences, as the domains of additively representable or separable preferences. In such domains, only single-lapping rules satisfy strategy-proofness, individual rationality, non-bossiness, and flexibility. Single-lapping rules are characterized by severe restrictions on the set of feasible coalitions. These restrictions are consistent with hierarchical organizations and imply that single-lapping rules always select core-stable partitions. Thus, our results highlight the relation between the non-cooperative concept of strategy-proofness and the cooperative concept of core-stability. We analyze the implications of our results for matching problems

    Isoperimetric inequalities in Riemann surfaces of infinite type

    Get PDF
    75 pages, 1 figure.-- MSC2000 code: 30F45.MR#: MR1715412 (2000j:30075)Zbl#: Zbl 0935.30028Research partially supported by a grant from Dirección General de Enseñanza Superior (Ministerio de Educación y Ciencia), Spain.Publicad

    On the optimism correction of the area under the receiver operating characteristic curve in logistic prediction models

    Get PDF
    When the same data are used to fit a model and estimate its predictive performance, this estimate may be optimistic, and its correction is required. The aim of this work is to compare the behaviour of different methods proposed in the literature when correcting for the optimism of the estimated area under the receiver operating characteristic curve in logistic regression models. A simulation study (where the theoretical model is known) is conducted considering different number of covariates, sample size, prevalence and correlation among covariates. The results suggest the use of k-fold cross-validation with replication and bootstrap.Peer Reviewe

    Effect of deformation on two-neutrino double beta decay matrix elements

    Full text link
    We study the effect of deformation on the two-neutrino double beta decay for ground state to ground state transitions in all the nuclei whose half-lives have been measured. Our theoretical framework is a deformed QRPA based in Woods-Saxon or Hartree-Fock mean fields. We are able to reproduce at the same time the main characteristics of the two single beta branches, as well as the double beta matrix elements. We find a suppression of the double beta matrix element with respect to the spherical case when the parent and daughter nuclei have different deformations

    Review of real brain-controlled wheelchairs

    Get PDF
    This paper presents a review of the state of the art regarding wheelchairs driven by a brain-computer interface (BCI). Using a brain-controlled wheelchair (BCW), disabled users could handle a wheelchair through their brain activity, granting autonomy to move through an experimental environment. A classification is established, based on the characteristics of the BCW, such as the type of electroencephalographic (EEG) signal used, the navigation system employed by the wheelchair, the task for the participants, or the metrics used to evaluate the performance. Furthermore, these factors are compared according to the type of signal used, in order to clarify the differences among them. Finally, the trend of current research in this field is discussed, as well as the challenges that should be solved in the future

    Approximation theory for weighted Sobolev spaces on curves

    Get PDF
    17 pages, no figures.-- MSC2000 codes: 41A10, 46E35, 46G10.MR#: MR1882649 (2003c:42002)In this paper we present a definition of weighted Sobolev spaces on curves and find general conditions under which the spaces are complete. We also prove the density of the polynomials in these spaces for non-closed compact curves and, finally, we find conditions under which the multiplication operator is bounded on the completion of polynomials. These results have applications to the study of zeroes and asymptotics of Sobolev orthogonal polynomials.Research of V. Álvarez, D. Pestana and J.M. Rodríguez partially supported by a grant from DGI, BFM2000-0206-C04-01, Spain.Publicad

    Generalized weighted Sobolev spaces and applications to Sobolev orthogonal polynomials, I

    Get PDF
    36 pages, no figures.-- MSC2000 codes: 41A10, 46E35, 46G10.-- Part II of this paper published in: Approx. Theory Appl. 18(2): 1-32 (2002), available at: http://e-archivo.uc3m.es/handle/10016/6483MR#: MR2047389 (2005k:42062)Zbl#: Zbl 1081.42024In this paper we present a definition of Sobolev spaces with respect to general measures, prove some useful technical results, some of them generalizations of classical results with Lebesgue measure and find general conditions under which these spaces are complete. These results have important consequences in approximation theory. We also find conditions under which the evaluation operator is bounded.Research by first (J.M.R.), third (E.R.) and fourth (D.P.) authors was partially supported by a grant from DGI (BFM 2000-0206-C04-01), Spain.Publicad
    corecore