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

Tel Aviv University

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

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

Keywords

Approachability
Game theory
Optimization

All Science Journal Classification (ASJC) codes

Information Systems and Management
General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.ejor.2020.11.013

Cite this

@article{0ffdb02a483842918e3a7f43ece5cbfc,

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 - مقالة

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

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this