Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Neary, Philip R."'
A run of the deferred acceptance (DA) algorithm may contain proposals that are sure to be rejected. We introduce the accelerated deferred acceptance algorithm that proceeds in a similar manner to DA but with sure-to-be rejected proposals ruled out. A
Externí odkaz:
http://arxiv.org/abs/2409.06865
In order to coordinate players in a game must first identify a target pattern of behaviour. In this paper we investigate the difficulty of identifying prominent outcomes in two kinds of binary action coordination problems in social networks: pure coo
Externí odkaz:
http://arxiv.org/abs/2311.03195
We introduce and study a new optimization problem on digraphs, termed Maximum Weighted Digraph Partition (MWDP) problem. We prove three complexity dichotomies for MWDP: on arbitrary digraphs, on oriented digraphs, and on symmetric digraphs. We demons
Externí odkaz:
http://arxiv.org/abs/2307.01109
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordination games and anti-coordination games. We consider three objectives in
Externí odkaz:
http://arxiv.org/abs/2305.07124
In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main contribution i
Externí odkaz:
http://arxiv.org/abs/2204.03989
Publikováno v:
In Games and Economic Behavior November 2024 148:244-263
Autor:
Eiben, Eduard, Gutin, Gregory, Neary, Philip R., Rambaud, Clément, Wahlström, Magnus, Yeo, Anders
An instance $I$ of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in $I$ is the exchange of two consecutive vertices in a preference list. A swap can be viewed as a smalles
Externí odkaz:
http://arxiv.org/abs/2112.15361
Autor:
Lynham, John, Neary, Philip R.
This paper proposes a stylized, dynamic model to address the issue of sorting online. There are two large homogeneous groups of individuals. Everyone must choose between two online platforms, one of which has superior amenities (akin to having superi
Externí odkaz:
http://arxiv.org/abs/2110.05608
An individual can only experience regret if she learns about an unchosen alternative. In many situations, learning about an unchosen alternative is possible only if someone else chose it. We develop a model where the ex-post information available to
Externí odkaz:
http://arxiv.org/abs/2109.10968
Publikováno v:
In Journal of Economic Theory July 2024 219