Payoffs-dependent Balancedness and Cores

We provide a result for non-emptiness of the core in NTU games. We use a payoffs-dependent balancedness condition, based on transfer rate mappings. Going beyond the non-emptiness of standard core, existence of some refined solution is proved, including specific core allocations and equilibrium-core allocations in parameterized collection of cooperative games. The proofs borrow mathematical tools and geometric constructions from general equilibrium theory with non convexities. Applications to various extant results taken from game theory and economic theory are given.Cooperative games, Core solutions, Non-emptiness

A Bayesian Incentive Compatible Mechanism for Fair Division

We consider the problem of fairly allocating one indivisible object when monetary transfers are possible, and examine the existence of Bayesian incentive compatible mechanisms to solve the problem. We propose a mechanism that satisfies envy-freeness, budget balancedness, and Bayesian incentive compatibility. Further, we establish the uniqueness of the mechanism under an order additivity condition. This result contrasts well with various results on the incompatibility between efficiency and ex post incentive compatibility.

Budget Balancedness and Optimal Income Taxation

We make two main contributions to the theory of optimal income taxation. First, assuming conditions sufficient for existence of a Pareto optimal income tax and public goods mechanism, we show that if agents’ preferences satisfy an extended notion of single crossing called capacity constrained single crossing, then there exists a Pareto optimal income tax and public goods mechanism that is budget balancing. Second, we show that, even without capacity constrained single crossing, existence of a budget balancing, Pareto optimal income tax and public goods mechanism is guaranteed if the set of agent types contains no atoms.Optimal Income Taxation, Public Goods, Budget Balancing, Single Crossing, Nonatomic Economy, Atomless Economy

The coincidence of the core and the dominance core on multi-choice games

We propose a necessary and sufficient condition for the existence of dominance core and a necessary and sufficient condition for coincidence of the core and the dominance core to the setting of multi-choice games.

The Fuzzy Core and the (Π, β)- Balanced Core

This note provides a new proof of the non-emptiness of the fuzzy core in a pureexchange economy with finitely many agents. The proof is based on the concept of(Π, β)-balanced core for games without side payments due to Bonnisseau and Iehlé(2003).microeconomics ;

Scalable and Robust Community Detection with Randomized Sketching

This paper explores and analyzes the unsupervised clustering of large partially observed graphs. We propose a scalable and provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is first applied to a sub-matrix of the graph's adjacency matrix associated with a reduced graph sketch constructed using random sampling. Then, the clusters of the full graph are inferred based on the clusters extracted from the sketch using a correlation-based retrieval step. Uniform random node sampling is shown to improve the computational complexity over clustering of the full graph when the cluster sizes are balanced. A new random degree-based node sampling algorithm is presented which significantly improves upon the performance of the clustering algorithm even when clusters are unbalanced. This algorithm improves the phase transitions for matrix-decomposition-based clustering with regard to computational complexity and minimum cluster size, which are shown to be nearly dimension-free in the low inter-cluster connectivity regime. A third sampling technique is shown to improve balance by randomly sampling nodes based on spatial distribution. We provide analysis and numerical results using a convex clustering algorithm based on matrix completion

A Simple Computational Model for Acceptance/Rejection of Binary Sequence Generators

A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic operations. The proposed model can serve as a deterministic alternative to existing probabilistic methods for checking balancedness in binary sequence generators. The procedure here described can be devised as a first selective criterium for acceptance/rejection of this type of generators.Comment: 16 pages, 0 figure