Philip R. Neary

Royal Holloway University of London — United Kingdom

Decision Sciences · Social Sciences

5h-index177citations36works0.42yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Game Theory and Applications(20), Game Theory and Voting Systems(18), Experimental Behavioral Economics Studies(11), Auction Theory and Applications(7), Complexity and Algorithms in Graphs(6)

Publications36 total

Pairwise Imitation and Tournament Graphs
International Economic Review·2026
Public Goods Games in Directed Networks with Constraints on Sharing
arXiv (Cornell University)·2025Open Access
Note on the size of a stable matching
arXiv (Cornell University)·2025Open Access
Pairwise imitation and tournament graphs *
SSRN Electronic Journal·2025· 1 citedOpen Access
Finding all stable matchings with assignment constraints
Games and Economic Behavior·2024Open Access
Speeding up deferred acceptance
arXiv (Cornell University)·2024Open Access
Tiebout sorting in online communities
The Annals of Regional Science·2024Open Access
Public goods in networks with constraints on sharing
Journal of Economic Theory·2024· 3 citedOpen Access
Getting Permission: Experimental Evidence
SSRN Electronic Journal·2024Open Access
Some coordination problems are harder than others
arXiv (Cornell University)·2023Open Access
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems
2023Open Access
Unique stable matchings
Games and Economic Behavior·2023Open Access
Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem
arXiv (Cornell University)·2023Open Access
Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems
arXiv (Cornell University)·2023· 1 citedOpen Access
Exact capacitated domination: On the computational complexity of uniqueness
Discrete Applied Mathematics·2023· 1 citedOpen Access
Preference swaps for the stable matching problem
Theoretical Computer Science·2022· 1 citedOpen Access
Finding all stable matchings with assignment constraints
arXiv (Cornell University)·2022Open Access
Finding All Stable Matchings with Assignment Constraints
SSRN Electronic Journal·2022Open Access
Preference Swaps for the Stable Matching Problem
arXiv (Cornell University)·2021Open Access
Tiebout sorting in online communities
arXiv (Cornell University)·2021· 1 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Gregory Gutin(20), Anders Yeo(17), Jonathan Newton(7), Sung‐Ha Hwang(6), Eduard Eiben(6), Wooyoung Lim(5), Argyrios Deligkas(5), Stefanie Gerke(3), John Lynham(3), Sung-Ha Hwang(2), Clément Rambaud(2), Magnus Wahlström(2), Ryoji Sawa(1), Joel Sobel(1), Mark Jones(1), Claudia Cerrone(1), Francesco Feri(1), Sung‐Ha Hwang(1), Ryoji Sawa(1), Gregory Gutin(1)