Research Output per year
Fingerprint Dive into the research topics where Walter Kern is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 4 Similar Profiles
Coalitions
Mathematics
Costs
Engineering & Materials Science
Approximation Algorithms
Mathematics
Game
Mathematics
Congestion Games
Mathematics
Price of Anarchy
Mathematics
Problem Decomposition
Mathematics
Bin Packing
Mathematics
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Research Output 1989 2018
Greedy Oriented Flows
Faigle, U., Kern, W. & Peis, B., 1 Apr 2018, In : Algorithmica. 80, 4, p. 1298-1314 17 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Greedy Algorithm
Augmentation
Path
Oriented Matroid
Incidence Matrix
2
Citations
(Scopus)
66
Downloads
(Pure)
The asymptotic price of anarchy for k-uniform congestion games
de Jong, J., Kern, W., Steenhuisen, B. & Uetz, M., 2018, Approximation and Online Algorithms: 15th International Workshop, WAOA 2017, Revised Selected Papers. Solis-Oba, R. (ed.). Springer, Vol. 10787 LNCS. p. 317-328 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10787 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review
Open Access
File
Congestion Games
Price of Anarchy
Cost functions
Resources
Costs
The Boundedly Rational User Equilibrium: A parametric analysis with application to the Network Design Problem
Eikenbroek, O. A. L., Still, G. J., van Berkum, E. C. & Kern, W., Jan 2018, In : Transportation research. Part B: Methodological. 107, p. 1-17 17 p.Research output: Contribution to journal › Article › Academic › peer-review
Travel time
rationality
pricing
continuity
travel
4
Citations
(Scopus)
31
Downloads
(Pure)
The stable fixtures problem with payments
Biró, P., Kern, W., Paulusma, D. & Wojuteczky, P., 1 Mar 2018, In : Games and economic behavior. 108, p. 245-268 24 p.Research output: Contribution to journal › Article › Academic › peer-review
Payment
Assignment game
Polynomials
Integer
NP-complete
Approximating bounded-degree spanning trees and connected factors with leaves
Kern, W. & Manthey, B., Mar 2017, In : Operations research letters. 45, 2, p. 115-118 4 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Approximation algorithms
Spanning tree
Leaves
Vertex Degree
Approximation Algorithms
Activities 1993 1993
- 1 Oral presentation
Approximately fair allocation in euclidean TSP games
Walter Kern (Speaker)22 Oct 1993
Activity: Talk or presentation › Oral presentation