default search action
Jeroen Kuipers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j25]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)
2010 – 2019
- 2016
- [j24]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) - 2014
- [j23]János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers
Non-existence of subgame-perfect \(\varepsilon \) -equilibrium in perfect information games with infinite horizon. Int. J. Game Theory 43(4): 945-951 (2014) - [c2]Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers
Existence of Secure Equilibrium in Multi-player Games with Perfect Information. MFCS (2) 2014: 213-225 - [i1]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
- [j22]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) - [j21]János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze:
Subgame-perfection in free transition games. Eur. J. Oper. Res. 228(1): 201-207 (2013) - 2011
- [j20]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
- [j19]Jeroen Kuipers, Dries Vermeulen
A generalization of the Shapley-Ichiishi result. Int. J. Game Theory 39(4): 585-602 (2010) - [j18]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) - [j17]János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers
Perfect-Information Games with Lower-Semicontinuous Payoffs. Math. Oper. Res. 35(4): 742-755 (2010) - [c1]János Flesch, Gijs Schoenmakers, Jeroen Kuipers, Koos Vrieze:
Subgame-perfection in positive recursive games. BQGT 2010: 9:1
2000 – 2009
- 2009
- [j16]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
- [j15]Jeroen Kuipers, Norma Olaizola
A dynamic approach to cartel formation. Int. J. Game Theory 37(3): 397-408 (2008) - [j14]Javier Arin, Jeroen Kuipers, Dries Vermeulen
An axiomatic approach to egalitarianism in TU-games. Int. J. Game Theory 37(4): 565-580 (2008) - 2006
- [j13]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
- [j12]Joris van de Klundert
Selecting Telecommunication Carriers to Obtain Volume Discounts. Interfaces 35(2): 124-132 (2005) - [j11]Elena Inarra
Absorbing and generalized stable sets. Soc. Choice Welf. 24(3): 433-437 (2005) - 2004
- [j10]Javier Arin, Jeroen Kuipers, Dries Vermeulen
Geometry and Computation of the Lorenz Set. IGTR 6(2): 223-238 (2004) - 2003
- [j9]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
- [j8]Daniel Granot, Jeroen Kuipers, Sunil Chopra
Cost Allocation for a Tree Network with Heterogeneous Customers. Math. Oper. Res. 27(4): 647-661 (2002) - 2001
- [j7]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) - 2000
- [j6]Jeroen Kuipers, Tamás Solymosi
Computing the nucleolus of some combinatorially-structured games. Math. Program. 88(3): 541-563 (2000)
1990 – 1999
- 1998
- [j5]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) - [j4]Jeroen Kuipers:
Bin packing games. Math. Methods Oper. Res. 47(3): 499-510 (1998) - 1997
- [j3]Jean Derks
On the core of routing games. Int. J. Game Theory 26(2): 193-205 (1997) - [j2]Jeroen Kuipers:
Minimum cost forest games. Int. J. Game Theory 26(3): 367-377 (1997) - 1993
- [j1]Jeroen Kuipers:
A note on the 5-person traveling salesman game. ZOR Methods Model. Oper. Res. 38(2): 131-139 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: