# Unit Vector Games

@article{Savani2015UnitVG, title={Unit Vector Games}, author={Rahul Savani and Bernhard von Stengel}, journal={ArXiv}, year={2015}, volume={abs/1501.02243} }

McLennan and Tourky (2010) showed that “imitation games” provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke‐Howson algorithm. In an imitation game, the payoff matrix of one of the players is the identity matrix. We study the more general “unit vector games”, which are already known, where the payoff matrix of one player is composed of unit vectors. Our main application is a simplification of the construction by Savani and von Stengel (2006) of bimatrix… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Complexity of the gale string problem for equilibrium computation in games

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 27 REFERENCES

## Imitation games and computation

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Convex Polytopes, 2nd ed

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Lemke Paths on Simple Polytopes

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Bimatrix Equilibrium Points and Mathematical Programming

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Neighborly and cyclic polytopes

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Geometry and equilibria in bimatrix games

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL

## Finding Nash equilibria of bimatrix games

VIEW 3 EXCERPTS

## A note on the Lemke-Howson algorithm

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Oriented Euler complexes and signed perfect matchings

VIEW 1 EXCERPT