Apt, K.R., Markakis, E. (2009) Optimal strategies in sequential bidding.

In Decker, K.S. Sichman, J.S. Sierra, C. Castelfranchi, C. (Eds.), AAMAS 2009: the 8th International Conference on Autonomous Agents and Multiagent Systems: May 10-15, 2009, Budapest, Hungary: proceedings. - Volume 2 (pp 1189-1190). IFAAMAS.

Apt, K.R., Markakis, E. (2009) Sequential bidding in the Bailey-Cavallo mechanism.

In Leonardi, S. (Eds.), Internet and Network Economics: 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009 : proceedings (pp 483-490) (Lecture Notes in Computer Science, Vol. 5929). Springer.

Apt, K.R., Markakis, E. (2011) Diffusion in social networks with competing products.

In Persiano, G. (Eds.), Algorithmic Game Theory: 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19 2011: proceedings (pp 212-223) (Lecture Notes in Computer Science, Vol. 6982). Springer.

Apt, K.R., Markakis, E. (2014) Social Networks with Competing Products.

Fundamenta Informaticae, Vol. 129 (pp 225-250)

Article | https://doi.org/10.3233/FI-2014-970 | UvA-DARE

Apt, K.R., Monfroy, E. (2001) Constraint Programming viewed as Rule-based Programming.

Theory and Practice of Logic Programming, Vol. 1 (pp 713-750)

Article | https://doi.org/10.1017/S1471068401000072 | UvA-DARE

Apt, K.R., Olderog, E.R. (1994) Programmverifikation.

Springer Verlag.

Book | UvA-DARE

Apt, K.R., Pedreschi, D. (1994) Modular Termination Proofs for Logic and Pure Prolog Programs.

In Levi, G. (Eds.), Advances in Logic Programming Theory (pp 183-229). Oxford University Press.

Apt, K.R., Pellegrini, A. (1994) On the occur-check free Prolog programs.

ACM Transactions on Programming Languages and Systems, Vol. 16 (pp 687-726)

Article | https://doi.org/10.1145/177492.177673 | UvA-DARE

Apt, K.R., Rahn, M., Schäfer, G., Simon, S. (2014) Coordination Games on Graphs.

In Liu, T.-Y. Qi, Q. Ye, Y. (Eds.), Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014: proceedings (pp 441-446) (Lecture Notes in Computer Science, Vol. 8877). Springer.

Apt, K.R., Rossi, F., Venable, K.B. (2005) CP-nets and Nash equilibria.

In Proceedings of CIRAS '05 (pp 1-6). Elsevier.

Apt, K.R., Rossi, F., Venable, K.B. (2008) A comparison of the notions of optimality in soft constraints and graphical games.

In Fages, F. Rossi, F. Soliman, S. (Eds.), Recent Advances in Constraints: 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007 Rocquencourt, France, June 7-8, 2007 : revised selected papers (pp 1-16) (Lecture Notes in Computer Science, Vol. 5129). Springer.

Apt, K.R., Rossi, F., Venable, K.B. (2008) Comparing the notions of optimality in CP-nets, strategic games and soft constraints.

Annals of Mathematics and Artificial Intelligence, Vol. 52 (pp 25-54)

Article | https://doi.org/10.1007/s10472-008-9095-4 | UvA-DARE

Apt, K.R., Schaerf, A. (1999) Programming in Alma-0, or Imperative and Declarative Programming Reconciled.

In Gabbay, D.M. de Rijke, M. (Eds.), Frontiers of Combining Systems 2 (pp 1-16). Research Studies Press Ltd.

Apt, K.R., Schäfer, G. (2012) Selfishness level of strategic games.

In Serna, M. (Eds.), Algorithmic Game Theory: 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings (pp 13-24) (Lecture Notes in Computer Science, Vol. 7615). Springer.

Apt, K.R., Schäfer, G. (2014) Selfishness Level of Strategic Games.

Journal of Artificial Intelligence Research, Vol. 49 (pp 207-240)

Article | https://doi.org/10.1613/jair.4164 | UvA-DARE

Apt, K.R., Schrijver, A., Temme, N. (1994) From Universal Morphisms to Megabytes: A Baayen Space Odyssey.

CWI.

Book | UvA-DARE

Apt, K.R., Simon, S. (2012) A classification of weakly acyclic games.

In Serna, M. (Eds.), Algorithmic Game Theory: 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings (pp 1-12) (Lecture Notes in Computer Science, Vol. 7615). Springer.

Apt, K.R., Simon, S. (2013) Social Network Games with Obligatory Product Selection.

Electronic Proceedings in Theoretical Computer Science, Vol. 119 (pp 180-193)

Article | https://doi.org/10.4204/EPTCS.119.16 | UvA-DARE

Apt, K.R., Smaus, J. (2001) ``Rule-based versus Procedure-based View of Programming''.

Joint Bulletin of the Novosibirsk Computing Center and Institute of Information Systems, Vol. 16 (pp 75-97)

Article | UvA-DARE

Apt, K.R., Teusink, F. (1995) Comparing negation in logic programming and in Prolog.

In Turini, F. Apt, K.R. (Eds.), Meta-logics and Logic Programming (pp 111-133). The MIT Press.