中文
相关论文

相关论文: How Hard Is It to Control A Group?

200 篇论文

Our aim is to estimate the largest community (a.k.a., mode) in a population composed of multiple disjoint communities. This estimation is performed in a fixed confidence setting via sequential sampling of individuals with replacement. We…

统计理论 · 数学 2023-09-25 Meera Pai , Nikhil Karamchandani , Jayakrishnan Nair

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

计算机科学中的逻辑 · 计算机科学 2015-03-20 Hubie Chen

Classification is a fundamental task in supervised learning, while achieving valid misclassification rate control remains challenging due to possibly the limited predictive capability of the classifiers or the intrinsic complexity of the…

统计方法学 · 统计学 2025-09-16 Yinrui Sun , Yin Xia

This paper analyzes a society composed of individuals who have diverse sets of beliefs (or models) and diverse tastes (or utility functions). It characterizes the model selection process of a social planner who wishes to aggregate…

理论经济学 · 经济学 2026-02-10 Florian Mudekereza

Committee selection with diversity or distributional constraints is a ubiquitous problem. However, many of the formal approaches proposed so far have certain drawbacks including (1) computationally intractability in general, and (2)…

人工智能 · 计算机科学 2018-04-02 Haris Aziz

Social influence is the process by which individuals adapt their opinion, revise their beliefs, or change their behavior as a result of social interactions with other people. In our strongly interconnected society, social influence plays a…

物理与社会 · 物理学 2013-11-15 Mehdi Moussaid , Juliane E. Kaemmer , Pantelis P. Analytis , Hansjoerg Neth

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

信息论 · 计算机科学 2018-10-05 Jonathan Scarlett

Recent studies on indirect reciprocity with private assessment on complete graphs suggest the possibility that one can continuously modulate the degree of segregation by controlling how to judge a good person helping a bad one. A well-known…

物理与社会 · 物理学 2025-09-30 Quang Anh Le , Minwoo Bae , Takashi Shimada , Seung Ki Baek

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

逻辑 · 数学 2023-06-22 Manuel Bodirsky , Johannes Greiner

Behavioral adoptions are influenced by peers in different ways. While some individuals may change after a single incoming influence, others need multiple cumulated attempts. These two mechanism, known as the simple and the complex…

物理与社会 · 物理学 2024-12-02 Elsa Andres , Romualdo Pastor-Satorras , Michele Starnini , Márton Karsai

We aim at enforcing hard constraints to impose a global structure on sequences generated from Markov models. In this report, we study the complexity of sampling Markov sequences under two classes of constraints: Binary Equalities and…

计算复杂性 · 计算机科学 2017-11-29 Stephane Rivaud , François Pachet

A new approach for the description of phenomena of social aggregation is suggested. On the basis of psychological concepts (as for instance social norms and cultural coordinates), we deduce a general mechanism for the social aggregation in…

物理与社会 · 物理学 2011-04-29 Daniele Vilone , Andrea Guazzini

We use a model of opinion formation to study the consequences of some mechanisms attempting to enforce the right behaviour in a society. We start from a model where the possible choices are not equivalent (such is the case when the agents…

物理与社会 · 物理学 2012-12-18 M. F. Laguna , G. Abramson , J. R. Iglesias

The sample complexity of multi-group learning is shown to improve in the group-realizable setting over the agnostic setting, even when the family of groups is infinite so long as it has finite VC dimension. The improved sample complexity is…

机器学习 · 计算机科学 2026-01-26 Navid Ardeshir , Samuel Deng , Daniel Hsu , Jingwen Liu

We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…

计算复杂性 · 计算机科学 2014-06-09 Felipe Cucker

Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…

人工智能 · 计算机科学 2012-07-19 Manuel Bodirsky , Martin Hils , Alex Krimkevich

This work proposes and evaluates a novel approach to determine interesting categorical attributes for lists of entities. Once identified, such categories are of immense value to allow constraining (filtering) a current view of a user to…

数据库 · 计算机科学 2017-11-30 Koninika Pal , Sebastian Michel

In our digital and connected societies, the development of social networks, online shopping, and reputation systems raises the question of how individuals use social information, and how it affects their decisions. We report experiments…

We consider the problem of distribution-free conformal prediction and the criterion of group conditional validity. This criterion is motivated by many practical scenarios including hidden stratification and group fairness. Existing methods…

机器学习 · 计算机科学 2023-03-21 Samuel Deng , Navid Ardeshir , Daniel Hsu

When assessing group solvency, an important question is to what extent intragroup transfers may be considered, as this determines to which extent diversification can be achieved. We suggest a framework to describe the families of admissible…

风险管理 · 定量金融 2016-11-02 Andreas Haier , Ilya Molchanov , Michael Schmutz