33 citations · 64 across the 7 of their papers we have counts for
7 papers
Equilibrium Numbers in Non-Square Bimatrix Games
Constantin Ickstadt, Thorsten Theobald, Bernhard von Stengel
Bimatrix games may have an exponential number of mixed Nash equilibria if both dimensions of the game are allowed to grow. Bounds on their maximal number give structural insights t…
The Condorcet Dimension of Metric Spaces
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
A Condorcet winning set is a set of candidates such that no other candidate is preferred by at least half the voters over all members of the set. The Condorcet dimension, which is…
Zero-Sum Games and Linear Programming Duality
Bernhard von Stengel
The minimax theorem for zero-sum games is easily proved from the strong duality theorem of linear programming. For the converse direction, the standard proof by Dantzig (1951) is k…
Fast Algorithms for Rank-1 Bimatrix Games
Bharat Adsul, Jugal Garg, Ruta Mehta +2
The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices. This paper comprehensively analyzes games of rank one, and shows the following: (1) For a game…
Recursive Inspection Games
Bernhard von Stengel
We consider a sequential inspection game where an inspector uses a limited number of inspections over a larger number of time periods to detect a violation (an illegal act) of an i…
Nash Codes for Noisy Channels
Penelope Hernandez, Bernhard von Stengel
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decisio…
Optimal Lower Bounds for Projective List Update Algorithms
Christoph Ambuehl, Bernd Gaertner, Bernhard von Stengel
The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be somewhere between 1.5 and 1.6. An algorithm with competitiv…