3 citations · 13 across the 8 of their papers we have counts for
9 papers
Partitioned Matching Games for International Kidney Exchange
Márton Benedek, Péter Biró, Walter Kern +2
We introduce partitioned matching games as a suitable model for international kidney exchange programmes, where in each round the total number of available kidney transplants needs…
Disjoint Paths and Connected Subgraphs for H-Free Graphs
Walter Kern, Barnaby Martin, Daniël Paulusma +2
The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k distinct pairs. We deter…
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value
Frits Hof, Walter Kern, Sascha Kurz +2
A simple game is given by a set of players and a partition of~ into a set~ of losing coalitions~ with value that is closed under takin…
Contracting to a Longest Path in H-Free Graphs
Walter Kern, Daniel Paulusma
We prove two dichotomy results for detecting long paths as patterns in a given graph. The NP-hard problem Longest Induced Path is to determine the longest induced path in a graph.…
Simple Games versus Weighted Voting Games
Frits Hof, Walter Kern, Sascha Kurz +1
A simple game is given by a set of players and a partition of into a set of losing coalitions with value that is closed under takin…
Note on VCG vs. Price Raising for Matching Markets
Walter Kern, Bodo Manthey, Marc Uetz
In \cite{EK10} the use of VCG in matching markets is motivated by saying that in order to compute market clearing prices in a matching market, the auctioneer needs to know the true…
On the Factor Revealing LP Approach for Facility Location with Penalties
Xian Qiu, Walter Kern
We consider the uncapacitated facility location problem with (linear) penalty function and show that a modified JMS algorithm, combined with a randomized LP rounding technique due…
The Stable Fixtures Problem with Payments
Péter Biró, Walter Kern, Daniël Paulusma +1
We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph , with an integer vertex capacity function and a…
Max-Flow on Regular Spaces
Ulrich Faigle, Walter Kern, Britta Peis
The max-flow and max-coflow problem on directed graphs is studied in the common generalization to regular spaces, i.e., to kernels or row spaces of totally unimodular matrices. Exh…