English
Related papers

Related papers: Coalitional stability under myopic expectations an…

200 papers

Coalition Logic is primarily concerned with what coalitions can achieve, whereas what coalitions cannot achieve -- their \emph{inability} -- has received comparatively little explicit attention. This asymmetry matters in artificial…

Logic in Computer Science · Computer Science 2026-05-01 Shanxia Wang

Coherent structures are solutions to reaction-diffusion systems that are time-periodic in an appropriate moving frame and spatially asymptotic at $x=\pm\infty$ to spatially periodic travelling waves. This paper is concerned with sources…

Analysis of PDEs · Mathematics 2015-05-27 Margaret Beck , Toan Nguyen , Bjorn Sandstede , Kevin Zumbrun

Many real-world networks such as social networks consist of strategic agents. The topology of these networks often plays a crucial role in determining the ease and speed with which certain information driven tasks can be accomplished.…

Social and Information Networks · Computer Science 2017-07-03 Swapnil Dhamal , Y. Narahari

We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…

Computer Science and Game Theory · Computer Science 2015-09-11 Jared D. Lichtman

We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic…

Quantum Physics · Physics 2022-10-05 Frederic Dupuis , Omar Fawzi , Renato Renner

A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…

Populations and Evolution · Quantitative Biology 2016-09-02 James P. L. Tan

In real-world scenarios, the application of reinforcement learning is significantly challenged by complex non-stationarity. Most existing methods attempt to model changes in the environment explicitly, often requiring impractical prior…

Machine Learning · Computer Science 2024-06-04 Wanpeng Zhang , Yilin Li , Boyu Yang , Zongqing Lu

We introduce a new notion of the stability of computations, which holds under post-processing and adaptive composition. We show that the notion is both necessary and sufficient to ensure generalization in the face of adaptivity, for any…

Machine Learning · Computer Science 2020-01-01 Katrina Ligett , Moshe Shenfeld

In the framework of model-based clustering, a model allowing several latent class variables is proposed. This model assumes that the distribution of the observed data can be factorized into several independent blocks of variables. Each…

Methodology · Statistics 2018-01-23 Matthieu Marbac , Vincent Vandewalle

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

Computer Science and Game Theory · Computer Science 2015-12-10 William Zeng , Philipp Zahn

We investigate the conditions under which a set of multipartite nonlocal correlations can describe the distributions achievable by distant parties conducting experiments in a consistent universe. Several questions are posed, such as: are…

Quantum Physics · Physics 2015-09-18 Ben Lang , Tamas Vertesi , Miguel Navascues

Classical correlations without predefined causal order arise from processes where parties manipulate random variables, and where the order of these interactions is not predefined. No assumption on the causal order of the parties is made,…

Quantum Physics · Physics 2016-01-18 Ämin Baumeler , Stefan Wolf

An unconventional approach for optimal stopping under model ambiguity is introduced. Besides ambiguity itself, we take into account how ambiguity-averse an agent is. This inclusion of ambiguity attitude, via an $\alpha$-maxmin nonlinear…

Mathematical Finance · Quantitative Finance 2021-07-15 Yu-Jui Huang , Xiang Yu

We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students. We study several settings, which…

Computer Science and Game Theory · Computer Science 2019-06-21 Ágnes Cseh , Tamás Fleiner , Petra Harján

This position paper reflects on the state-of-the-art in decision-making under uncertainty. A classical assumption is that probabilities can sufficiently capture all uncertainty in a system. In this paper, the focus is on the uncertainty…

Artificial Intelligence · Computer Science 2023-03-13 Thom Badings , Thiago D. Simão , Marnix Suilen , Nils Jansen

A general system of difference equations is presented for multispecies communities with density dependent population growth and delayed maturity. Interspecific competition, mutualism, predation, commensalism, and amensalism are…

Populations and Evolution · Quantitative Biology 2025-09-03 Geoffrey R. Hosack , Maud El-Hachem , Nicholas J. Beeton

In this paper, we focus on the problem of stable prediction across unknown test data, where the test distribution is agnostic and might be totally different from the training one. In such a case, previous machine learning methods might…

Machine Learning · Computer Science 2020-06-11 Kun Kuang , Bo Li , Peng Cui , Yue Liu , Jianrong Tao , Yueting Zhuang , Fei Wu

Nguyen et al. [1] introduced altruistic hedonic games in which agents' utilities depend not only on their own preferences but also on those of their friends in the same coalition. We propose to extend their model to coalition formation…

Computer Science and Game Theory · Computer Science 2023-01-16 Anna Maria Kerkmann , Simon Cramer , Jörg Rothe

In this work, we consider ranking problems among a finite set of candidates: for instance, selecting the top-$k$ items among a larger list of candidates or obtaining the full ranking of all items in the set. These problems are often…

Machine Learning · Statistics 2025-06-04 Ruiting Liang , Jake A. Soloff , Rina Foygel Barber , Rebecca Willett

We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…

Computer Science and Game Theory · Computer Science 2019-06-06 Jiehua Chen , Piotr Skowron , Manuel Sorge