Approachability in repeated games: Computational aspects and a Stackelberg variant
type: Item
instance of: scholarly article
title: Approachability in repeated games: Computational aspects and a Stackelberg variant
zbMATH Open document ID: 1161.91320
author: Shie Mannor
author: John N. Tsitsiklis
published in: Games and Economic Behavior
publication date: 2009-06-08T00:00:00Z
Mathematics Subject Classification ID: 91A20
Mathematics Subject Classification ID: 91A35
Mathematics Subject Classification ID: 68Q99
zbMATH DE Number: 5562816
MaRDI profile type: Publication
full work available at URL: j.geb.2008.03.008
OpenAlex ID: W2057841929
cites work: An analog of the minimax theorem for vector payoffs
cites work: A general class of adaptive strategies
cites work: Q3873927
cites work: Some NP-complete problems in quadratic and nonlinear programming
DOI: 10.1016/J.GEB.2008.03.008
description: scientific article; zbMATH DE number 5562816