Bridging Utility Maximization and Regret Minimization

dc.contributor.advisor	Silvio Micali
dc.contributor.author	Chiesa, Alessandro	en_US
dc.contributor.author	Micali, Silvio	en_US
dc.contributor.author	Zhu, Zeyuan Allen	en_US
dc.contributor.other	Theory of Computation	en
dc.date.accessioned	2013-12-03T20:45:05Z
dc.date.available	2013-12-03T20:45:05Z
dc.date.issued	2013-12-03
dc.identifier.uri	http://hdl.handle.net/1721.1/82632
dc.description.abstract	We relate the strategies obtained by (1) utility maximizers who use regret to refine their set of undominated strategies, and (2) regret minimizers who use weak domination to refine their sets of regret-minimizing strategies.	en_US
dc.format.extent	9 p.	en_US
dc.relation.ispartofseries	MIT-CSAIL-TR-2013-029	en_US
dc.title	Bridging Utility Maximization and Regret Minimization	en_US
dc.date.updated	2013-12-03T20:45:05Z