References

  1. R. Alur, T. A. Henzinger & O. Kupferman (2002): Alternating-Time Temporal Logic. Journal of the ACM 49, pp. 672–713, doi:10.1145/585265.585270.
  2. Krzysztof R Apt, Bart de Keijzer, Mona Rahn, Guido Schäfer & Sunil Simon (2017): Coordination games on graphs. International Journal of Game Theory 46(3), pp. 851–877, doi:10.1007/s00182-016-0560-8.
  3. Krzysztof R Apt & Sunil Simon (2015): A classification of weakly acyclic games. Theory and Decision 78(4), pp. 501–524, doi:10.1007/978-3-642-33996-7_1.
  4. Krzysztof R. Apt, Sunil Simon & Dominik Wojtczak (2015): Coordination Games on Directed Graphs. In: Proc. of 15th International Conference on Theoretical Aspects of Rationality and Knowledge, doi:10.4204/EPTCS.215.6.
  5. J. van Benthem (2001): Games in dynamic epistemic logic. Bulletin of Economic Research 53(4), pp. 219–248, doi:10.1111/1467-8586.00133.
  6. J. van Benthem (2002): Extensive games as process models. Journal of Logic Language and Information 11, pp. 289–313, doi:10.1023/A:1015534111901.
  7. Johan van Benthem & Amélie Gheerbrant (2010): Game Solution, Epistemic Dynamics and Fixed-Point Logics. Fundamenta Informaticae 100(1-4), pp. 19–41, doi:10.3233/FI-2010-261.
  8. G. Bonanno (2001): Branching Time Logic, Perfect Information Games and Backward Induction. Games and Economic Behavior 36(1), pp. 57–73, doi:10.1006/game.1999.0812.
  9. Sylvain Bouveret, Yann Chevaleyre & Nicolas Maudet (2016): Fair Allocation of Indivisible Goods, chapter 12, Handbook of Computational Social Choice. Cambridge University Press.
  10. Simina Branzei, Ariel D. Procaccia & Jie Zhang (2013): Externalities in cake cutting. In: Proceedings of the 23rd IJCAI, pp. 55–61.
  11. E. Budish (2011): The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy 119(6), pp. 1061–1103, doi:10.1086/664613.
  12. Krishnendu Chatterjee, Thomas A. Henzinger & Nir Piterman (2010): Strategy logic. Information and Computation 208(6), pp. 677–693, doi:10.1016/j.ic.2009.07.004.
  13. Y. Chevaleyre, U. Endriss & N. Maudet (2017): Distributed Fair Allocation of Indivisible Goods. Artificial Intelligence 242, pp. 1–22, doi:10.1016/j.artint.2016.09.005.
  14. Anastasia Damamme, Aurélie Beynier, Yann Chevaleyre & Nicolas Maudet (2015): The power of swap deals in distributed resource allocation. In: Proceedings of 14th International Conference on Autonomous Agents and Multiagent Systems, pp. 625–633.
  15. H. Ebbinghaus & J. Flum (1999): Finite Model Theory. Springer, doi:10.1007/3-540-28788-4.
  16. R. Engelberg & M. Schapira (2011): Weakly-Acyclic (Internet) Routing Games. In: Proc. 4th International Symposium on Algorithmic Game Theory (SAGT11), Lecture Notes in Computer Science 6982. Springer, pp. 290–301, doi:10.1007/978-3-642-24829-0_26.
  17. Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo & Makoto Yokoo (2015): A Complexity Approach for Core-Selecting Exchange with Multiple Indivisible Goods under Lexicographic Preferences.. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 907–913, doi:10.1613/jair.1.11254.
  18. M. Ghodsi, H. Saleh & M. Seddighin (2018): Fair Allocation of Indivisible Items With Externalities. CoRR abs/1805.06191. Available at http://arxiv.org/abs/1805.06191.
  19. V. Goranko (2003): The Basic Algebra of Game Equivalences. Studia Logica 75(2), pp. 221–238, doi:10.1023/A:1027311011342.
  20. Laurent Gourves, Julien Lesca & Anaëlle Wilczynski (2017): Object allocation via swaps along a social network. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI’17), pp. 213–219, doi:10.24963/ijcai.2017/31.
  21. Martin Grohe (1994): The Structure of Fixed Point Logics. Albert-Ludwigs-Universitat.
  22. P. Harrenstein, W. van der Hoek, J.J. Meyer & C. Witteven (2003): A Modal Characterization of Nash Equilibrium. Fundamenta Informaticae 57(2-4), pp. 281–321.
  23. W. van der Hoek, W. Jamroga & M. Wooldridge (2005): A Logic for Strategic Reasoning. Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 157–164, doi:10.1145/1082473.1082497.
  24. E.B. Janovskaya (1968): Equilibrium Points in Polymatrix Games. Litovskii Matematicheskii Sbornik 8, pp. 381–384.
  25. Bernd Kawald & Pascal Lenzner (2013): On Dynamics in Selfish Network Creation. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, pp. 83 – 92, doi:10.1145/2486159.2486185.
  26. O. Lev & J. S. Rosenschei (2012): Convergence of iterative voting. In: Proceedings of AAMAS-2012, pp. 611–618.
  27. Leonid Libkin (2013): Elements of finite model theory. Springer, doi:10.1007/978-3-662-07003-1.
  28. J.R. Marden, G. Arslan & J.S. Shamma (2007): Regret based dynamics: convergence in weakly acyclic games. In: Proceedings of the Sixth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007). IFAAMAS, pp. 194–201, doi:10.1145/1329125.1329175.
  29. Reshef Meir, Maria Polukarov, Jeffrey S.Rosenschein & Nicholas R.Jennings (2017): Iterative voting and acyclic games. Artificial Intelligence 252, pp. 100–122, doi:10.1016/j.artint.2017.08.002.
  30. I. Milchtaich (1996): Congestion Games with Player-Specific Payoff Functions. Games and Economic Behaviour 13, pp. 111–124, doi:10.1006/game.1996.0027.
  31. D. Monderer & L. S. Shapley (1996): Potential Games. Games and Economic Behaviour 14, pp. 124–143, doi:10.1006/game.1996.0044.
  32. Roger B. Myerson & Robert J. Weber (1993): A Theory of Voting Equilibria. The American Political Science Review 87(1), pp. 102–114, doi:10.2307/2938959.
  33. R. Parikh (1985): The logic of games and its applications. Annals of Discrete Mathematics 24, pp. 111–140, doi:10.1016/S0304-0208(08)73078-0.
  34. R. Ramanujam & S. Simon (2008): Dynamic logic on games with structured strategies. In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR-08). AAAI Press, pp. 49–58.
  35. A. Reijngoud & U. Endriss (2012): Voter response to iterated poll information. In: Proceedings of AAMAS-2012, pp. 635–644.
  36. R. W. Rosenthal (1973): A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2(1), pp. 65–67, doi:10.1007/BF01737559.
  37. Nicole Schweikardt (2005): Arithmetic, first-order logic, and counting quantifiers. ACM Transactions on Computational Logic 6(3), pp. 634–671, doi:10.1145/1071596.1071602.
  38. Nicole Schweikardt (2006): On the expressive power of monadic least fixed point logic. Theoretical Computer Science 350, pp. 325–344, doi:10.1016/j.tcs.2005.10.025.
  39. L. S. Shapley & H. Scarf (1974): On cores and indivisibility. Journal of Mathematical Economics 1(1), pp. 23–37, doi:10.1016/0304-4068(74)90033-0.
  40. Zhaohong Sun, Hideaki Hata, Taiki Todo & Makoto Yokoo (2015): Exchange of Indivisible Objects with Asymmetry. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, pp. 97–103.
  41. D. Walther, W. van der Hoek & M. Wooldridge (2007): Alternating-time Temporal Logic with Explicit Strategies. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), pp. 269–278, doi:10.1145/1324249.1324285.
  42. H. Peyton Young (1993): The evolution of conventions. Econometrica 61(1), pp. 57–84, doi:10.2307/2951778.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org