Philip R. Neary

According to our database1, Philip R. Neary authored at least 14 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Public goods in networks with constraints on sharing.
J. Econ. Theory, 2024

Finding all stable matchings with assignment constraints.
Games Econ. Behav., 2024

Speeding up deferred acceptance.
CoRR, 2024

2023
Unique stable matchings.
Games Econ. Behav., September, 2023

Exact capacitated domination: On the computational complexity of uniqueness.
Discret. Appl. Math., June, 2023

Preference swaps for the stable matching problem.
Theor. Comput. Sci., 2023

Some coordination problems are harder than others.
CoRR, 2023

Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem.
CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games with Implications for Coordination Problems.
CoRR, 2023

Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2020
Uniqueness of DP-Nash Subgraphs and D-sets in Weighted Graphs of Netflix Games.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2018
Conventional contracts, intentional behavior and logit choice: Equality without symmetry.
Games Econ. Behav., 2018

2016
An experimental investigation of stochastic adjustment dynamics.
Games Econ. Behav., 2016

2012
Competing conventions.
Games Econ. Behav., 2012


  Loading...