#jsDisabledContent { display:none; } My Account | Register | Help

# Helly metric

Article Id: WHEBN0019088928
Reproduction Date:

 Title: Helly metric Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Helly metric

In game theory, the Helly metric is used to assess the distance between two strategies. It is named for Eduard Helly.

Consider a game \Gamma=\left\langle\mathfrak{X},\mathfrak{Y},H\right\rangle, between player I and II. Here, \mathfrak{X} and \mathfrak{Y} are the sets of pure strategies for players I and II respectively; and H=H(\cdot,\cdot) is the payoff function.

(in other words, if player I plays x\in\mathfrak{X} and player II plays y\in\mathfrak{Y}, then player I pays H(x,y) to player II).

The Helly metric \rho(x_1,x_2) is defined as

\rho(x_1,x_2)=\sup_{y\in\mathfrak{Y}}\left| H(x_1,y)-H(x_2,y)\right|.

The metric so defined is symmetric, reflexive, and satisfies the triangle inequality.

The Helly metric measures distances between strategies, not in terms of the differences between the strategies themselves, but in terms of the consequences of the strategies. Two strategies are distant if their payoffs are different. Note that \rho(x_1,x_2)=0 does not imply x_1=x_2 but it does imply that the consequences of x_1 and x_2 are identical; and indeed this induces an equivalence relation.

If one stipulates that \rho(x_1,x_2)=0 implies x_1=x_2 then the topology so induced is called the natural topology.

The metric on the space of player II's strategies is analogous:

\rho(y_1,y_2)=\sup_{x\in\mathfrak{X}}\left| H(x,y_1)-H(x,y_2)\right|.

Note that \Gamma thus defines two Helly metrics: one for each player's strategy space.

## Conditional compactness

Notation (definition of an \epsilon-net). A set X_\epsilon is an \epsilon-net in the space X with metric \rho if for any x\in X there exists x_\epsilon\in X_\epsilon with \rho(x,x_\epsilon)<\epsilon.

A metric space P is conditionally compact if for any \epsilon>0 there exists a finite \epsilon-net in P.

A game that is conditionally compact in the Helly metric has an \epsilon-optimal strategy for any \epsilon>0.

## Other results

If the space of strategies for one player is conditionally compact, then the space of strategies for the other player is conditionally compact (in their Helly metric).

## References

N. N. Vorob'ev 1977. Game theory lectures for economists and systems scientists. Springer-Verlag (translated by S. Kotz).

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.