Watch and learn: optimizing from revealed preferences feedback
From MaRDI portal
Publication:5361893
DOI10.1145/2897518.2897579zbMath1377.91046arXiv1504.01033OpenAlexW2410251583MaRDI QIDQ5361893
Zhiwei Steven Wu, Aaron Roth, Jonathan R. Ullman
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01033
Analysis of algorithms and problem complexity (68Q25) Hierarchical games (including Stackelberg games) (91A65) 2-person games (91A05) Individual preferences (91B08)
Related Items (5)
Social welfare and profit maximization from revealed preferences ⋮ Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks ⋮ Unnamed Item ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Optimally Deceiving a Learning Leader in Stackelberg Games
This page was built for publication: Watch and learn: optimizing from revealed preferences feedback
