3 citations · 5 across the 12 of their papers we have counts for
16 papers
Neural networks and games
Philip R. Neary
Hopfield neural networks and noncooperative games provide seemingly different approaches to understanding how collective outcomes emerge from local interactions. In a neural networ…
When are complements and substitutes dual?
Philip R. Neary
For binary-action games on bipartite networks, strategic complements and strategic substitutes are one and the same: each can be transformed into the other by relabelling the actio…
Public Goods Games in Directed Networks with Constraints on Sharing
Argyrios Deligkas, Gregory Gutin, Mark Jones +2
In a public goods game, every player chooses whether or not to buy a good that all neighboring players will have access to. We consider a setting in which the good is indivisible,…
Note on the size of a stable matching
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contain…
Speeding up deferred acceptance
Gregory Z. Gutin, Daniel Karapetyan, Philip R. Neary +2
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 si…
Some coordination problems are harder than others
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
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 kin…
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
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 arbitrar…
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
Argyrios Deligkas, Eduard Eiben, Gregory Gutin +2
We investigate the difficulty of finding economically efficient solutions to coordination problems on graphs. Our work focuses on two forms of coordination problem: pure-coordinati…
Finding all stable matchings with assignment constraints
Gregory Gutin, Philip R. Neary, Anders Yeo
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 assigne…
Preference Swaps for the Stable Matching Problem
Eduard Eiben, Gregory Gutin, Philip R. Neary +3
An instance of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in is the exchange of two consec…
Tiebout sorting in online communities
John Lynham, Philip R. Neary
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…
Ignorance is Bliss: A Game of Regret
Claudia Cerrone, Francesco Feri, Philip R. Neary
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 ch…
Unique Stable Matchings
Gregory Z. Gutin, Philip R. Neary, Anders Yeo
In this paper we consider the issue of a unique prediction in one to one two sided matching markets, as defined by Gale and Shapley (1962), and we prove the following. Theorem. Let…
The Effect of Social Distancing on the Reach of an Epidemic in Social Networks
Gregory Gutin, Tomohiro Hirano, Sung-Ha Hwang +2
How does social distancing affect the reach of an epidemic in social networks? We present Monte Carlo simulation results of a capacity constrained Susceptible-Infected-Removed (SIR…
Exact capacitated domination: on the computational complexity of uniqueness
Gregory Gutin, Philip R Neary, Anders Yeo
In this paper we consider a local service-requirement assignment problem named exact capacitated domination from an algorithmic point of view. This problem aims to find a solution…
Public goods in networks with constraints on sharing
Stefanie Gerke, Gregory Gutin, Sung-Ha Hwang +1
This paper considers incentives to provide goods that are partially shareable along social links. We introduce a model in which each individual in a social network not only decides…