Jeroen Kuipers

From MaRDI portal
Person:257248

Available identifiers

zbMath Open kuipers.jeroenMaRDI QIDQ257248

List of research outcomes

PublicationDate of PublicationType
Approximating the value of zero-sum differential games with linear payoffs and dynamics2023-07-26Paper
Subgame perfection in recursive perfect information games2021-12-13Paper
Subgame-perfection in recursive perfect information games, where each player controls one state2016-04-08Paper
Sharing costs in highways: a game theoretic approach2016-03-15Paper
Subgame-perfection in free transition games2016-03-15Paper
Non-existence of subgame-perfect \(\varepsilon \)-equilibrium in perfect information games with infinite horizon2014-12-12Paper
Existence of Secure Equilibrium in Multi-player Games with Perfect Information2014-10-14Paper
On Chinese postman games where residents of each road pay the cost of their road2011-07-08Paper
A generalization of the Shapley-ichiishi result2011-05-05Paper
Subgame Perfection in Positive Recursive Games with Perfect Information2011-04-27Paper
Perfect-Information Games with Lower-Semicontinuous Payoffs2011-04-27Paper
Pure subgame-perfect equilibria in free transition games2009-12-07Paper
https://portal.mardi4nfdi.de/entity/Q36467672009-11-27Paper
An axiomatic approach to egalitarianism in TU-games2009-01-30Paper
A dynamic approach to cartel formation2008-11-25Paper
Computing an element in the lexicographic kernel of a game2008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q33744712006-03-09Paper
Absorbing and generalized stable sets2005-12-09Paper
Cost Allocation for a Tree Network with Heterogeneous Customers2005-11-11Paper
GEOMETRY AND COMPUTATION OF THE LORENZ SET2005-03-30Paper
Some characterizations of egalitarian solutions on classes of TU-games.2004-02-03Paper
On the computation of the nucleolus of a cooperative game2003-11-23Paper
https://portal.mardi4nfdi.de/entity/Q48050962003-05-08Paper
https://portal.mardi4nfdi.de/entity/Q47834022003-02-04Paper
Bin packing games2000-07-12Paper
Computing the nucleolus of min-cost spanning tree games is NP-hard.2000-04-11Paper
Computing the nucleolus of some combinatorially-structured games.2000-01-01Paper
Minimum cost forest games1997-08-28Paper
On the core of routing games1997-07-03Paper
A note on the 5-person traveling salesman game1993-12-06Paper
On the core of information graph games1993-06-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeroen Kuipers