English
Related papers

Related papers: Stability, Fairness and Random Walks in the Bargai…

200 papers

Recent extensions to dynamic games of the well-known fictitious play learning procedure in static games were proved to globally converge to stationary Nash equilibria in two important classes of dynamic games (zero-sum and…

Computer Science and Game Theory · Computer Science 2022-07-08 Lucas Baudin , Rida Laraki

In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restricted structures?…

Theoretical Economics · Economics 2025-07-03 Pinaki Mandal

Nash equilibria are defined using uncorrelated behavioural or mixed joint probability distributions effectively assuming that players of bounded rationality must discard information to locate equilibria. We propose instead that rational…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Kae Nemoto , Michael J Gagen

In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…

Computer Science and Game Theory · Computer Science 2024-01-08 Naoyuki Kamiyama

We construct Nash equilibria in feedback form for a class of two-person stochastic games of singular control with absorption, arising from a stylized model for corporate finance. More precisely, the paper focusses on a strategic dynamic…

Optimization and Control · Mathematics 2025-07-04 Tiziano De Angelis , Fabien Gensbittel , Stéphane Villeneuve

The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to any two-sided market. In the classical formulation, n…

Artificial Intelligence · Computer Science 2010-07-07 M. Gelain , M. S. Pini , F. Rossi , K. B. Venable , T. Walsh

In coalition formation games self-organized coalitions are created as a result of the strategic interactions of independent agents. For each couple of agents $(i,j)$, weight $w_{i,j}=w_{j,i}$ reflects how much agents $i$ and $j$ benefit…

Computer Science and Game Theory · Computer Science 2018-04-19 Gianpiero Monaco , Luca Moscardelli , Yllka Velaj

The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes) and machines (of varying capacities) that is "stable" based…

Data Structures and Algorithms · Computer Science 2014-11-26 Ágnes Cseh , Brian C. Dean

In many game-theoretic settings, agents are challenged with taking decisions against the uncertain behavior exhibited by others. Often, this uncertainty arises from multiple sources, e.g., incomplete information, limited computation,…

Computer Science and Game Theory · Computer Science 2025-07-22 Nicolas Lanzetti , Sylvain Fricker , Saverio Bolognani , Florian Dörfler , Dario Paccagnan

Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who…

Data Structures and Algorithms · Computer Science 2021-12-14 Hugo Gimbert , Claire Mathieu , Simon Mauras

The Navier-Stokes motions in a box with periodic boundary conditions are considered. First the existence of global regular two-dimensional solutions is proved. The solutions are such that continuous with respect to time norms are controlled…

Analysis of PDEs · Mathematics 2016-06-16 Wojciech M. Zajaczkowski

The global dynamics is investigated for a duopoly game where the perfect foresight hypothesis is relaxed and firms are worst-case maximizers. Overlooking the degree of product substitutability as well as the sensitivity of price to…

Theoretical Economics · Economics 2023-11-21 Davide Radi , Laura Gardini

We study Nash equilibria in strategic facility location games where clients are located in an arbitrary metric space. Specifically, there are $n$ clients, and the goal is to choose a facility from a set of given locations, so that the total…

Computer Science and Game Theory · Computer Science 2026-04-21 Yue Gruszecki , Elliot Anshelevich

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…

Probability · Mathematics 2021-07-13 Steven Heilman

We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement…

Computational Complexity · Computer Science 2010-06-11 Danny Hermelin , Chien-Chung Huang , Stefan Kratsch , Magnus Wahlstrom

Hedonic games provide a natural model of coalition formation among self-interested agents. The associated problem of finding stable outcomes in such games has been extensively studied. In this paper, we identify simple conditions on…

Computer Science and Game Theory · Computer Science 2015-07-14 Dominik Peters , Edith Elkind

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

Computer Science and Game Theory · Computer Science 2026-05-11 Ian Gemp , Crystal Qian , Marc Lanctot , Kate Larson

In this paper we study continuous-time stochastic control problems with both monotone and classical controls motivated by the so-called public good contribution problem. That is the problem of n economic agents aiming to maximize their…

Optimization and Control · Mathematics 2018-05-23 Giorgio Ferrari , Frank Riedel , Jan-Henrik Steg

Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be…

Computer Science and Game Theory · Computer Science 2020-03-05 Daniel Lehmann

This paper develops a new methodology for studying continuous-time Nash equilibrium in a financial market with asymmetrically informed agents. This approach allows us to lift the restriction of risk neutrality imposed on market makers by…

Probability · Mathematics 2016-09-05 Umut Çetin , Albina Danilova
‹ Prev 1 4 5 6 7 8 10 Next ›