Approachability with constraints

Gaëtan Fournier; Eden Kuperwasser; Orin Munk; Eilon Solan; Avishay Weinbaum

doi:10.1016/j.ejor.2020.11.013

Approachability with constraints

Gaëtan Fournier^*, Eden Kuperwasser, Orin Munk, Eilon Solan, Avishay Weinbaum

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex.

Original language	English
Pages (from-to)	687-695
Number of pages	9
Journal	European Journal of Operational Research
Volume	292
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2020.11.013
State	Published - 16 Jul 2021

Funding

Funders	Funder number
ANR Labex IAST
European Network of Game Theory
European Cooperation in Science and Technology
Agence Nationale de la Recherche	2017-EUR-20
Israel Science Foundation	323/13, 217/17

Keywords

Approachability
Game theory
Optimization

Access to Document

10.1016/j.ejor.2020.11.013

Cite this

@article{5fb06685439745e6b1c5541fea8a4726,

title = "Approachability with constraints",

abstract = "We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex.",

keywords = "Approachability, Game theory, Optimization",

author = "Ga{\"e}tan Fournier and Eden Kuperwasser and Orin Munk and Eilon Solan and Avishay Weinbaum",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2021",

month = jul,

day = "16",

doi = "10.1016/j.ejor.2020.11.013",

language = "אנגלית",

volume = "292",

pages = "687--695",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Approachability with constraints

AU - Fournier, Gaëtan

AU - Kuperwasser, Eden

AU - Munk, Orin

AU - Solan, Eilon

AU - Weinbaum, Avishay

PY - 2021/7/16

Y1 - 2021/7/16

N2 - We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex.

AB - We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we study the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff converges to the set A, while the average payoff always remains in D. We provide a full characterization of these pairs when D is convex and open, and a sufficient condition when D is not convex.

KW - Approachability

KW - Game theory

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=85097671821&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2020.11.013

DO - 10.1016/j.ejor.2020.11.013

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85097671821

SN - 0377-2217

VL - 292

SP - 687

EP - 695

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

Approachability with constraints

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this