the SCIENTIFIC HOMEPAGE of JEAN DERKS
Contents:
- My scientific background
- Published papers in refereed journals
- Papers presented for publication in
refereed journals
- Publications in non-refereed Journals and
Proceedings
- Unpublished reports
If you have any questions,
suggestions or remarks, please send me an e-mail (jean.derks@math.unimaas.nl). Last
revised: juli 21, 2010
I got my mathematical
education at the University
of Nijmegen. The bachelors degree was obtained in
1979, with main subjects the usual basic mathematical stuff, computer science
(Prof. dr. C. Koster) and astronomy. Graduation, in
1983, was based on the following main subjects: mathematical economics (mar) and operations research (Prof.dr. S. Tijs),
probability theory (Prof.dr. W. Vervaat) and economics (imp).
Stef Tijs supervised the master thesis ''Transport
van goederenbundels in netwerken''
(multi-commodity flows in networks) (tra).
The approach of
Multi-commodity flow situations with cooperative game theory was my first
research subject (see sta and tot) during my two years
stay (1984-1986) as a research assistant in
For my activities at home
and personal information please look at my personal
homepage.
Published papers in refereed journals: (information on the journals
and coauthors are gathered here)
(ins) R. Amer, J. Derks, J. Giménez,
On cooperative games, inseparable by semivalues.
International Journal of Game Theory, 32: 181--188, 2003.
(sce) G.M. Boas, O.J. Vrieze, J.J.M. Derks, J.
Scenario-analyse coronaire hartziekten.
Cardiologie, 2: 96--101, 1995.
(eff) Walter Bossert,
Efficiency in Uncertain Cooperative Games.
Mathematical Social Sciences, 50: 12--23, 2005.
(bal) I.J. Curiel,
J.J.M. Derks, and S.H. Tijs.
On balanced games and flow games with committee control.
OR Spektrum, 11:83--88, 1989.
(dec) J.J.M. Derks.
Decomposition
of games with non-empty core into veto-controlled simple games.
OR Spektrum, 9:81--85, 1987.
(ext) J.J.M. Derks.
On the extreme elements of the class of (0,1)-normalized
superadditive games.
In H.J.M. Peters and O.J. Vrieze,
editors, Surveys in Game Theory and Related Topics. CWI Tract 39,
Centrum voor Wiskunde en Informatica, Amsterdam, 1987.
(sho) J.J.M. Derks.
A short proof of the
inclusion of the core in the weber set.
International Journal of Game Theory, 21:149--150, 1992.
(lin) J.J.M. Derks.
On linear inequality systems without strongly redundant
constraints.
European Journal of Operational Research, 81:652--662, 1995.
(pro)
A new Proof of Weber’s characterization of the random order Values
Mathematical Social Sciences, 49: 327--334, 2005.
(sem) J.J.M.
Derks and T.S.H. Driessen.
A decomposition of the class of semiconvex
games.
OR Spektrum, 15:133--137, 1993.
(hie) J.J.M. Derks and
R.P. Gilles.
Hierarchical organization structures and constraints on
coalition formation.
International Journal of Game Theory, 24:147--163, 1995.
(nul) J.J.M.
Derks and H.H. Haller.
Null players out? linear
values for games with variable supports.
International Game Theory Review 1, Nos. 3 & 4, 301-314, 1999.
(wei) J.J.M.
Derks and H.H. Haller.
Weighted nucleoli.
International Journal of Game Theory 28, 173-188, 1999.
(sel)
The selectope for cooperative
games.
International Journal of Game Theory 29, 23-38, 2000.
(rou)
On
the core of routing games.
International Journal of Game Theory 26, 193-206, 1997.
(poi)
On the number of extreme points of the core of
a transferable utility game.
In: Peter Borm and Hans
Peters (Eds.) Chapters in Game Theory,
Kluwer Academic Publishers,
(exi) Derks, J.,
Existence of Nash networks in the one-way flow model of network formation,
In: Neogy S. K. et al. (eds.), Modeling, Computation
and Optimization, World Scientific, pp 9--19, 2009
(hwe) J. Derks, G. van der
Laan, V. Vasil'ev,
Characterizations of the random order
values by Harsanyi payoff vectors.
Mathematical Methods of Operations Research 62, issue 3, 2006.
(him) J. Derks, G. van der
Laan, V. Vasil'ev,
On the Harsanyi payoff vectors and Harsanyi imputations.
Theory and Deision 68, 301-310, 2010..
(sha)
J.J.M. Derks and H.J.M. Peters.
A shapley value for games with restricted coalitions.
International Journal of Game Theory 21, 351-360, 1992.
(con) J. Derks, and H. Peters.
Consistent restricted Shapley Values
Mathematical Social Sciences 33, 75-91, 1997.
(koh)
Orderings, Excess Functions, and the Nucleolus
Mathematical Social Sciences 36, 175-182, 1998.
(per)
A Note on a Consistency Property for Permutations.
Discrete Mathematics 250, 241-244, 2002.
(mer)
On Merge Properties of the Shapley Value.
International Game Theory Review 2, No. 4, 249-257, 2000.
(coa)
On the Core of a Collection of Coalitions
International Journal of Game Theory 27, 451-459, 1998.
(dss) Jean
J.M. Derks and Frits C.R. Spieksma.
A decision support system for locating facilities and routing traffic on a
factory site.
Belgian Journal of Operations Research, Statistics and Computer Science, Vol.
36 (2-3), 173-184, 1996.
(not)
Derks, J., Tennekes, M.
A note on the existence of Nash networks in one-way flow models,
Economic Theory 41:515–522, 2009.
(pay)
Derks, J., Tennekes, M., .
Payoff functions in the one-way flow model of network formation for which Nash
networks exist.
Accepted for publication in International Game Theory Review,
2010.
(wor) H.M.J.
Goldschmidt, J.C.M. de Vries, G.G. van Merode, and J.J.M. Derks.
A workflow management tool for
laboratory medicine.
Laboratory automation and information management 33, 183-197, 1998.
(sup)
G.G. van Merode, A. Hasman,
J. Derks, H.M.J. Goldschmidt, B. Schoenmaker and M. Oosten,
Decision support for clinical laboratory capacity planning,
International Journal of Bio-medical Computing 38, 75-87, 1995.
(adv) G.G.
van Merode, A. Hasman, J.
Derks, B. Schoenmaker and H.M.J. Goldschmidt.
Advanced management
facilities for clinical laboratories.
Computer Methods and Programs in Biomedicine, 50:195-205, 1996.
(opt) G.G. van Merode, M. Oosten,
O.J. Vrieze, J. Derks, A. Hasman.
Optimization of the
structure of the clinical laboratory.
European Journal of Operational Research 105, 308-316, 1998.
Publications
in non-refereed Journals and Proceedings:
(sta) J.J.M. Derks and S.H. Tijs
Stable Outcomes for Multi-Commodity Flow Games,
Methods of Operations Research 50, 493-504, 1985.
(tot)
J.J.M. Derks and S.H. Tijs
Totally Balanced Multi-Commodity Games and Flow Games,
Methods of Operations Research 54, 335-347, 1986.
(pre) J. Oswald, J.
Derks and H. Peters,
Prenucleolus and Nucleolus of a Cooperative Game:
Characterizations by Tight Coalitions,
Proceedings of the 3rd International Conference on Approximation and
Optimization in the Caribbean,
Unpublished
reports:
(gen)
Generating Sets for the Class of Quasi-Balanced Games and Related Classes,
Report M89-01, Department of Mathematics, University of Limburg, Maastricht,
The Netherlands, 1989.
(cor)
On Cones of Games with non-empty Core,
Report M89-06, Department of Mathematics, University of Limburg, Maastricht,
The Netherlands, 1989.
(cov)
Cover games,
Report M91-06, Department of Mathematics,
(loc) Derks, J.,
Local dynamics in network formation.
Tech. rep.,
(axi)
Derks, J.,
An axiomatic approach covering the two-way flow model of
network formation.
Tech. rep., Maastricht University, Department of Knowledge
Engineering, 2008.
(sim)
O.J. Vrieze, S.A.M.J. Stevens and J.J.M. Derks,
Een Simulatiepakket voor Job-Shop Problemen,
Rapport WD 86-03, Wiskundige Dienstverlening, Katholieke Universiteit
Nijmegen, The Netherlands, 1986.
Currently
working on...
- (jan 2005) Implementing
the Simplex method for computing the prenucleolus
of transferable utility games. A revision and updating of (imp), with Jeroen
- (nov2004) Nash equilibria in network games,
with Jeroen Kuipers, Martijn Tennekens
and Frank Thuijsman.
- (mar 2004) command and control games, with Koos Vrieze.
- (oct2002) characterization of balanced
collections of matchings, with Jeroen Kuipers.
- (oct2001) extending standard TU-solutions with
the Shapley transfer method. Note in progress, with Hans Peters.
- (oct2000) A new stability concept for
cooperative games, with the properties of existence and full
coincidence with core stability. Draft in progress, with Hans
Peters.
- (jan 1999) The
conjecture that a convex game turns up after only finitely many minimarg operations (possibly atmost
the number of players according to computer simulations). With Stef Tijs and Bettina Klaus.
- A demographic
package (DOS) for the simulation of several populations
simultaneously, where interaction is allowed. Explanation of the model and
use of the package is provided (in dutch) and
also the source code (language c) is included. 1989.
- A tool for tackling large Markov problems.
1990.
- A simulation package, called HV, for the
study of the development of the coronary heart diseases in the
Netherlands. The main goal was an instrument for scenario analysis to be
used by politicians and decision makers in health care. Together with
Jeroen Kuipers, Gijs Boas and Koos Vrieze. 1990-1993.
- A simulation package, called SIMLAB and
written in the language SIMSCRIPT II.5, for analysing throughput times of
samples, examining the efficiency of the buffering of workstations, and
the allocation of labor in a clinical
laboratory. Together with Frits van Merode and
Bob Schoenmakers. 1992-1993.
- Translation of SIMLAB into a DOS package,
called CLAB, with some statistical functions. Main goal was to perform a
vast amount of testruns. 1994.
- Development of a commercial version of
CLAB, called SCALES (Support and Consequences through Advance Laboratory
Expert Systems), with a Windows 3.1 interface and a user friendly data
acquisition. Together with Frits van Merode, Henk Goldschmidt and Jules de Vries.
1995.
- A DOS-program for computing values in stochastic games. Source code (language c)
and explanation (in dutch) is included. 1995.
- A Windows 3.1-package, called PatientAgenda, for the administration of the
obligations of patients in a hospital. Central was the usability of it by
many users simultaneously, like nurses, therapeutists,
physicians (not the patient). Together with Inge
Uljee and Jeroen Donkers.
1995.
- RACE , a scenario analysis tool (Windows
3.1) for tackling traffic stream problems on small industrial locations.
Together with Frits Spieksma. 1996.
- A DOS-program for computing the prenucleolus of a
cooperative game. The algorithm is based on the Maschler-sequence
of linear programs, and the pivoting procedure is optimized for speed (of
order 2 to the power the number of players). It can handle up to 32
players but for 15 players or more there should be some structure in the
coalition values (for example, discrete or based on combinatorial models).
The program can handle different kinds of games like majority games, tree
games, and others. Also input of self defined games is organised such that
redundancy is minimized. A short explanation is provided. The algorithm is
explained theoretically in a research paper.
Together with Jeroen
- A supply-chain simulation model for
educational purposes, in Excel/VBA. 2001.
- A jobshop simulation,
in Matlab, of the problem, described on page 155
in the book "Simulation Modeling and Analysis (third edition)",
by A.M. Law and W.D Kelton (ISBN 0071165371). The
downloadable version is optimized on program length (print on one page,
i.e. less than 60 lines, without loosing readibility).
It does not contain performance measures, and the event and queue list
management are elementary but efficient for the present case. A version
with standard event and queue list management is downloadable here, but
with debug facilities it needs one extra page (again, without loosing the
standard indent layout). The simulation speed is improved by 20% if either event or queue list management is used, and more
than 40% if both are activated.
The simulation is validated extensively, and the utilization outcomes coincide with those of Law&Kelton. Queue length performance of 3 of the 5 workstations, however, differ significantly. What or which is wrong? 2005 - A cooperative game toolbox
in Matlab. The downloadable version is only to
be used for evaluation purposes. Consult me if you would like to use it
within your research activities. 2005.
