• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 31 matches

• 2023
• 
  Jeroen Kuipers, Gijs Schoenmakers, Katerina Stanková:
  Approximating the Value of Zero-Sum Differential Games with Linear Payoffs and Dynamics. J. Optim. Theory Appl. 198(1): 332-346 (2023)
• 2016
• 
  Jeroen Kuipers, János Flesch, Gijs Schoenmakers, Koos Vrieze:
  Subgame-perfection in recursive perfect information games, where each player controls one state. Int. J. Game Theory 45(1-2): 205-237 (2016)
• 2015
• 
  Farabi Muhammad Iqbal, Jeroen van der Ham, Fernando A. Kuipers:
  Technology-aware multi-domain multi-layer routing. Comput. Commun. 62: 85-96 (2015)
• 2014
• 
  János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eran Shmaya, Eilon Solan, Koos Vrieze:
  Non-existence of subgame-perfect \(\varepsilon \) -equilibrium in perfect information games with infinite horizon. Int. J. Game Theory 43(4): 945-951 (2014)
• 
  Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
  Existence of Secure Equilibrium in Multi-player Games with Perfect Information. MFCS (2) 2014: 213-225
• 
  Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
  Existence of Secure Equilibrium in Multi-Player Games with Perfect Information. CoRR abs/1405.1615 (2014)
• 2013
• 
  János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
  Subgame-perfection in free transition games. Eur. J. Oper. Res. 228(1): 201-207 (2013)
• 
  Jeroen Kuipers, Manuel A. Mosquera, José Manuel Zarzuelo:
  Sharing costs in highways: A game theoretic approach. Eur. J. Oper. Res. 228(1): 158-168 (2013)
• 2011
• 
  Daniel Granot, Herbert Hamers, Jeroen Kuipers, Michael Maschler:
  On Chinese postman games where residents of each road pay the cost of their road. Games Econ. Behav. 72(2): 427-438 (2011)
• 2010
• 
  Jeroen Kuipers, Dries Vermeulen, Mark Voorneveld:
  A generalization of the Shapley-Ichiishi result. Int. J. Game Theory 39(4): 585-602 (2010)
• 
  János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan, Koos Vrieze:
  Perfect-Information Games with Lower-Semicontinuous Payoffs. Math. Oper. Res. 35(4): 742-755 (2010)
• 
  János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
  Subgame Perfection in Positive Recursive Games with Perfect Information. Math. Oper. Res. 35(1): 193-207 (2010)
• 
  János Flesch, Gijs Schoenmakers, Jeroen Kuipers, Koos Vrieze:
  Subgame-perfection in positive recursive games. BQGT 2010: 9:1
• 2009
• 
  Jeroen Kuipers, János Flesch, Gijs Schoenmakers, Koos Vrieze:
  Pure subgame-perfect equilibria in free transition games. Eur. J. Oper. Res. 199(2): 442-447 (2009)
• 2008
• 
  Javier Arin, Jeroen Kuipers, Dries Vermeulen:
  An axiomatic approach to egalitarianism in TU-games. Int. J. Game Theory 37(4): 565-580 (2008)
• 
  Jeroen Kuipers, Norma Olaizola:
  A dynamic approach to cartel formation. Int. J. Game Theory 37(3): 397-408 (2008)
• 2006
• 
  Ulrich Faigle, Walter Kern, Jeroen Kuipers:
  Computing an Element in the Lexicographic Kernel of a Game. Math. Methods Oper. Res. 63(3): 427-433 (2006)
• 2005
• 
  Joris van de Klundert, Jeroen Kuipers, Frits C. R. Spieksma, Maarten Winkels:
  Selecting Telecommunication Carriers to Obtain Volume Discounts. Interfaces 35(2): 124-132 (2005)
• 
  Elena Inarra, Jeroen Kuipers, Norma Olaizola:
  Absorbing and generalized stable sets. Soc. Choice Welf. 24(3): 433-437 (2005)
• 2004
• 
  Javier Arin, Jeroen Kuipers, Dries Vermeulen:
  Geometry and Computation of the Lorenz Set. IGTR 6(2): 223-238 (2004)
• 2003
• 
  Javier Arin, Jeroen Kuipers, Dries Vermeulen:
  Some characterizations of egalitarian solutions on classes of TU-games. Math. Soc. Sci. 46(3): 327-345 (2003)
• 2002
• 
  Daniel Granot, Jeroen Kuipers, Sunil Chopra:
  Cost Allocation for a Tree Network with Heterogeneous Customers. Math. Oper. Res. 27(4): 647-661 (2002)
• 2001
• 
  Ulrich Faigle, Walter Kern, Jeroen Kuipers:
  On the computation of the nucleolus of a cooperative game. Int. J. Game Theory 30(1): 79-98 (2001)
• 
  Mark van den Brand, Arie van Deursen, Jan Heering, H. A. de Jong, Merijn de Jonge, Tobias Kuipers, Paul Klint, Leon Moonen, Pieter A. Olivier, Jeroen Scheerder, Jurgen J. Vinju, Eelco Visser, Joost Visser:
  The ASF+SDF Meta-environment: A Component-Based Language Development Environment. CC 2001: 365-370
• 
  Mark van den Brand, Arie van Deursen, Jan Heering, Hayco de Jong, Merijn de Jonge, Tobias Kuipers, Paul Klint, Leon Moonen, Pieter A. Olivier, Jeroen Scheerder, Jurgen J. Vinju, Eelco Visser, Joost Visser:
  The Asf+Sdf Meta-Environment: a Component-Based Language Development Environment. LDTA@ETAPS 2001: 3-8
• 2000
• 
  Jeroen Kuipers, Tamás Solymosi, Harry Aarts:
  Computing the nucleolus of some combinatorially-structured games. Math. Program. 88(3): 541-563 (2000)
• 1998
• 
  Ulrich Faigle, Walter Kern, Jeroen Kuipers:
  Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hard. Int. J. Game Theory 27(3): 443-450 (1998)
• 
  Jeroen Kuipers:
  Bin packing games. Math. Methods Oper. Res. 47(3): 499-510 (1998)
• 1997
• 
  Jean Derks, Jeroen Kuipers:
  On the core of routing games. Int. J. Game Theory 26(2): 193-205 (1997)
• 
  Jeroen Kuipers:
  Minimum cost forest games. Int. J. Game Theory 26(3): 367-377 (1997)

skipping 1 more match