相关论文: Balanced 2-subsets

This paper surveys the theory of multiple packings and coverings. The study of multiple arrangements started in the 60s of the last century, and it was restricted mostly to lattice arrangements on the plane or of general arrangements of…

LP-duality theory has played a central role in the study of the core, right from its early days to the present time. However, despite the extensive nature of this work, basic gaps still remain. We address these gaps using the following…

We propose a signed network formation game, in which pairs of individuals strategically change the signs of the edges in a complete network. These individuals are members of a social network who strategically reduce cognitive dissonances by…

The use of game theoretic models has been quite successful in describing various cooperative and non-cooperative optimization problems in networks and other domains of computer systems. In this paper, we study an application of game…

Many complex systems share two characteristics: 1) they are stochastic in nature, and 2) they are characterized by a large number of factors. At the same time, various natural complex systems appear to have two types of intertwined…

Normal-form two-player games are categorized by players into K analogy classes so as to minimize the prediction error about the behavior of the opponent. This results in Clustered Analogy-Based Expectation Equilibria in which strategies are…

We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set…

Classification data sets with skewed class proportions are called imbalanced. Class imbalance is a problem since most machine learning classification algorithms are built with an assumption of equal representation of all classes in the…

In 2009, Kong, Wang, and Lee began work on the problem of finding the edge-balanced index sets of complete bipartite graphs $K_{m,n}$ by solving the cases where $n=1$, $2$, $3$, $4$, and $5$, and also the case where $m=n$. In an article…

The core of a cooperative game on a set of players $N$ is one of the most popular concept of solution. When cooperation is restricted (feasible coalitions form a subcollection $\cF$ of $2^N$), the core may become unbounded, which makes it…

The problem of class imbalance is extensive for focusing on numerous applications in the real world. In such a situation, nearly all of the examples are labeled as one class called majority class, while far fewer examples are labeled as the…

In this chapter, we present the Cucker-Smale type flocking models, and discuss their mathematical structures and flocking theorems in terms of coupling strength, interaction topologies and initial data. In 2007, two mathematicians Felipe…

Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the sense of the (weighted) Euclidean distance, i.e., the…

This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…

We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…

We consider a family of operator-algebraic dynamical systems involving the Toeplitz algebras of higher-rank graphs. We explicitly compute the KMS states (equilibrium states) of these systems built from small graphs with up to four connected…

Finite time coherent sets [8] have recently been defined by a measure based objective function describing the degree that sets hold together, along with a Frobenius-Perron transfer operator method to produce optimally coherent sets. Here we…

In this paper, a novel approach for the optimal combination of binary classifiers is proposed. The classifier combination problem is approached from a Game Theory perspective. The proposed framework of adapted weighted majority rules (WMR)…

Motivated by the sequence form formulation of Koller et al. (GEB'96), this paper defines {\em bilinear games}, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games…

Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…