J. Kuipers

Available identifiers

zbMath Open kuipers.jeroenMaRDI QIDQ257248

List of research outcomes

Publication	Date of Publication	Type
Approximating the value of zero-sum differential games with linear payoffs and dynamics	2023-07-26	Paper
Subgame perfection in recursive perfect information games	2021-12-13	Paper
Subgame-perfection in recursive perfect information games, where each player controls one state	2016-04-08	Paper
Sharing costs in highways: a game theoretic approach	2016-03-15	Paper
Subgame-perfection in free transition games	2016-03-15	Paper
Non-existence of subgame-perfect \(\varepsilon \)-equilibrium in perfect information games with infinite horizon	2014-12-12	Paper
Existence of Secure Equilibrium in Multi-player Games with Perfect Information	2014-10-14	Paper
On Chinese postman games where residents of each road pay the cost of their road	2011-07-08	Paper
A generalization of the Shapley-ichiishi result	2011-05-05	Paper
Subgame perfection in positive recursive games with perfect information	2011-04-27	Paper
Perfect-information games with lower-semicontinuous payoffs	2011-04-27	Paper
Pure subgame-perfect equilibria in free transition games	2009-12-07	Paper
Existence of Nash networks in the one-way flow model of network formation	2009-11-27	Paper
An axiomatic approach to egalitarianism in TU-games	2009-01-30	Paper
A dynamic approach to cartel formation	2008-11-25	Paper
Computing an element in the lexicographic kernel of a game	2008-03-06	Paper
On the Chinese Postman game	2006-03-09	Paper
Absorbing and generalized stable sets	2005-12-09	Paper
Cost Allocation for a Tree Network with Heterogeneous Customers	2005-11-11	Paper
GEOMETRY AND COMPUTATION OF THE LORENZ SET	2005-03-30	Paper
Some characterizations of egalitarian solutions on classes of TU-games.	2004-02-03	Paper
On the computation of the nucleolus of a cooperative game	2003-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4805096	2003-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q4783402	2003-02-04	Paper
Bin packing games	2000-07-12	Paper
Computing the nucleolus of min-cost spanning tree games is NP-hard.	2000-04-11	Paper
Computing the nucleolus of some combinatorially-structured games.	2000-01-01	Paper
Minimum cost forest games	1997-08-28	Paper
On the core of routing games	1997-07-03	Paper
A note on the 5-person traveling salesman game	1993-12-06	Paper
On the core of information graph games	1993-06-29	Paper

Research outcomes over time

This page was built for person: J. Kuipers