Jeroen Kuipers

According to our database1, Jeroen Kuipers authored at least 26 papers between 1993 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Subgame-perfection in recursive perfect information games, where each player controls one state.
Int. J. Game Theory, 2016

2014
Non-existence of subgame-perfect \(\varepsilon \) -equilibrium in perfect information games with infinite horizon.
Int. J. Game Theory, 2014

Existence of Secure Equilibrium in Multi-player Games with Perfect Information.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Sharing costs in highways: A game theoretic approach.
Eur. J. Oper. Res., 2013

Subgame-perfection in free transition games.
Eur. J. Oper. Res., 2013

2011
On Chinese postman games where residents of each road pay the cost of their road.
Games Econ. Behav., 2011

2010
Subgame Perfection in Positive Recursive Games with Perfect Information.
Math. Oper. Res., 2010

Perfect-Information Games with Lower-Semicontinuous Payoffs.
Math. Oper. Res., 2010

A generalization of the Shapley-Ichiishi result.
Int. J. Game Theory, 2010

Subgame-perfection in positive recursive games.
Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009
Pure subgame-perfect equilibria in free transition games.
Eur. J. Oper. Res., 2009

2008
A dynamic approach to cartel formation.
Int. J. Game Theory, 2008

An axiomatic approach to egalitarianism in TU-games.
Int. J. Game Theory, 2008

2006
Computing an Element in the Lexicographic Kernel of a Game.
Math. Methods Oper. Res., 2006

2005
Absorbing and generalized stable sets.
Soc. Choice Welf., 2005

Selecting Telecommunication Carriers to Obtain Volume Discounts.
Interfaces, 2005

2004
Geometry and Computation of the Lorenz Set.
IGTR, 2004

2003
Some characterizations of egalitarian solutions on classes of TU-games.
Math. Soc. Sci., 2003

2002
Cost Allocation for a Tree Network with Heterogeneous Customers.
Math. Oper. Res., 2002

2001
On the computation of the nucleolus of a cooperative game.
Int. J. Game Theory, 2001

2000
Computing the nucleolus of some combinatorially-structured games.
Math. Program., 2000

1998
Bin packing games.
Math. Methods Oper. Res., 1998

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, 1998

1997
Minimum cost forest games.
Int. J. Game Theory, 1997

On the core of routing games.
Int. J. Game Theory, 1997

1993
A note on the 5-person traveling salesman game.
ZOR Methods Model. Oper. Res., 1993


  Loading...