Anja Rey

According to our database1, Anja Rey authored at least 18 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Hedonic Games with Ordinal Preferences and Thresholds.
J. Artif. Intell. Res., 2020

2019
Testing Individual-Based Stability Properties in Graphical Hedonic Games.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Testing Stability Properties in Graphical Hedonic Games.
CoRR, 2018

A Property Testing Framework for the Theoretical Expressivity of Graph Kernels.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Path-Disruption Games: Bribery and a Probabilistic Model.
Theory Comput. Syst., 2017

2016
Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games.
Ann. Math. Artif. Intell., 2016

Cost of Stability and Least Core in Path-Disruption Games.
Proceedings of the STAIRS 2016, 2016

Structural Control in Weighted Voting Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Structural Control in Weighted Voting Games: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Altruistic Hedonic Games.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Representing and Solving Hedonic Games with Ordinal Preferences and Thresholds.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time.
J. Artif. Intell. Res., 2014

Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2012
Probabilistic Path-Disruption Games.
Proceedings of the ECAI 2012, 2012

2011
Bribery in Path-Disruption Games.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010
Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs.
Proceedings of the STAIRS 2010, 2010

Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games.
Proceedings of the ECAI 2010, 2010


  Loading...