20,199 research outputs found
Optimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of fair and optimal partitions in
additively separable hedonic games. We show that, for strict preferences, a
Pareto optimal partition can be found in polynomial time while verifying
whether a given partition is Pareto optimal is coNP-complete, even when
preferences are symmetric and strict. Moreover, computing a partition with
maximum egalitarian or utilitarian social welfare or one which is both Pareto
optimal and individually rational is NP-hard. We also prove that checking
whether there exists a partition which is both Pareto optimal and envy-free is
-complete. Even though an envy-free partition and a Nash stable
partition are both guaranteed to exist for symmetric preferences, checking
whether there exists a partition which is both envy-free and Nash stable is
NP-complete.Comment: 11 pages; A preliminary version of this work was invited for
presentation in the session `Cooperative Games and Combinatorial
Optimization' at the 24th European Conference on Operational Research (EURO
2010) in Lisbo
Some Separable integer partition classes
Recently, Andrews introduced separable integer partition classes and analyzed
some well-known theorems. In this paper, we investigate partitions with parts
separated by parity introduced by Andrews with the aid of separable integer
partition classes with modulus . We also extend separable integer partition
classes with modulus to overpartitions, called separable overpartition
classes. We study overpartitions and the overpartition analogue of
Rogers-Ramanujan identities, which are separable overpartition classes
Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games
Additively separable hedonic games and fractional hedonic games have received
considerable attention. They are coalition forming games of selfish agents
based on their mutual preferences. Most of the work in the literature
characterizes the existence and structure of stable outcomes (i.e., partitions
in coalitions), assuming that preferences are given. However, there is little
discussion on this assumption. In fact, agents receive different utilities if
they belong to different partitions, and thus it is natural for them to declare
their preferences strategically in order to maximize their benefit. In this
paper we consider strategyproof mechanisms for additively separable hedonic
games and fractional hedonic games, that is, partitioning methods without
payments such that utility maximizing agents have no incentive to lie about
their true preferences. We focus on social welfare maximization and provide
several lower and upper bounds on the performance achievable by strategyproof
mechanisms for general and specific additive functions. In most of the cases we
provide tight or asymptotically tight results. All our mechanisms are simple
and can be computed in polynomial time. Moreover, all the lower bounds are
unconditional, that is, they do not rely on any computational or complexity
assumptions
Fast and exact search for the partition with minimal information loss
In analysis of multi-component complex systems, such as neural systems,
identifying groups of units that share similar functionality will aid
understanding of the underlying structures of the system. To find such a
grouping, it is useful to evaluate to what extent the units of the system are
separable. Separability or inseparability can be evaluated by quantifying how
much information would be lost if the system were partitioned into subsystems,
and the interactions between the subsystems were hypothetically removed. A
system of two independent subsystems are completely separable without any loss
of information while a system of strongly interacted subsystems cannot be
separated without a large loss of information. Among all the possible
partitions of a system, the partition that minimizes the loss of information,
called the Minimum Information Partition (MIP), can be considered as the
optimal partition for characterizing the underlying structures of the system.
Although the MIP would reveal novel characteristics of the neural system, an
exhaustive search for the MIP is numerically intractable due to the
combinatorial explosion of possible partitions. Here, we propose a
computationally efficient search to precisely identify the MIP among all
possible partitions by exploiting the submodularity of the measure of
information loss. Mutual information is one such submodular information loss
functions, and is a natural choice for measuring the degree of statistical
dependence between paired sets of random variables. By using mutual information
as a loss function, we show that the search for MIP can be performed in a
practical order of computational time for a reasonably large system. We also
demonstrate that MIP search allows for the detection of underlying global
structures in a network of nonlinear oscillators
Extraordinary dimension theories generated by complexes
We study the extraordinary dimension function dim_{L} introduced by
\v{S}\v{c}epin. An axiomatic characterization of this dimension function is
obtained. We also introduce inductive dimensions ind_{L} and Ind_{L} and prove
that for separable metrizable spaces all three coincide. Several results such
as characterization of dim_{L} in terms of partitions and in terms of mappings
into -dimensional cubes are presented. We also prove the converse of the
Dranishnikov-Uspenskij theorem on dimension-raising maps
The Partition Weight Enumerator of MDS Codes and its Applications
A closed form formula of the partition weight enumerator of maximum distance
separable (MDS) codes is derived for an arbitrary number of partitions. Using
this result, some properties of MDS codes are discussed. The results are
extended for the average binary image of MDS codes in finite fields of
characteristic two. As an application, we study the multiuser error probability
of Reed Solomon codes.Comment: This is a five page conference version of the paper which was
accepted by ISIT 2005. For more information, please contact the author
- âŚ