×

In memoriam Walter Kern. (English) Zbl 1473.01064


MSC:

01A70 Biographies, obituaries, personalia, bibliographies

Biographic References:

Kern, Walter
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Borchers, F. M.; Breeuwsma, P.; Kern, Walter; Slootbeek, J.; Still, G.; Tibben, W., Traffic user equilibrium and proportionality, Transp. Res. B, 79, 149-160 (2015)
[2] Eikenbroek, O. A.L.; Still, G.; van Berkum, E. C.; Kern, Walter, The boundedly rational user equilibrium: a parametric analysis with application to the network design problem, Transp. Res. B, 107, 1-17 (2018)
[3] Faigle, Ulrich; Hoffman, Alan J.; Kern, Walter, A characterization of nonnegative box-greedy matrices, SIAM J. Discrete Math., 9, 1, 1-6 (1996) · Zbl 0842.90095
[4] Faigle, Ulrich; Kern, Walter, On the core of ordered submodular cost games, Math. Program., 87, 3, 483-499 (2000) · Zbl 0980.90103
[5] Faigle, Ulrich; Kern, Walter, An order-theoretic framework for the greedy algorithm with applications to the core and weber set of cooperative games, Order, 17, 4, 353-375 (2000) · Zbl 1081.91501
[6] Faigle, Ulrich; Kern, Walter; Peis, Britta, A ranking model for the greedy algorithm and discrete convexity, Math. Program., 132, 1, 393-407 (2012) · Zbl 1250.90073
[7] Faigle, Ulrich; Kern, Walter; Peis, Britta, Greedy oriented flows, Algorithmica, 80, 4, 1298-1314 (2018) · Zbl 1397.90384
[8] Ohazulike, A. E.; Still, G.; Kern, Walter; van Berkum, E. C., Multi-stakeholder road pricing game: solution concepts, Int. J. Comput. Math. Sci., 6, 1-12 (2012)
[9] Shapley, Lloyd S., Cores of convex games, Int. J. Game Theory, 1, 1, 11-26 (1971) · Zbl 0222.90054
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.