1 citations · 1 across the 8 of their papers we have counts for
14 papers
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…