Show simple item record

dc.contributor.authorCarmona, G.
dc.contributor.authorSabourian, H.
dc.date.accessioned2021-05-19T10:56:45Z
dc.date.available2021-05-19T10:56:45Z
dc.date.issued2021-03-11
dc.identifier.otherCWPE2124
dc.identifier.otherC-INET2112
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/322557
dc.description.abstractWe establish a version of Blackwell’s (1956) approachability result with discounting. Our main result shows that, for convex sets, our notion of approachability with discounting is equivalent to Blackwell’s (1956) approachability. Our proofs are based on a concentration result for probability measures and on the minmax theorem for two-person, zero-sum games.
dc.publisherFaculty of Economics, University of Cambridge
dc.relation.ispartofseriesCambridge Working Papers in Economics
dc.relation.ispartofseriesCambridge-INET Working Paper Series
dc.rightsAll Rights Reserved
dc.rights.urihttps://www.rioxx.net/licenses/all-rights-reserved/
dc.subjectApproachability
dc.subjectRepeated Games
dc.titleApproachability with Discounting
dc.typeWorking Paper
dc.identifier.doi10.17863/CAM.70013


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record