IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v29y1999i1-2p79-103.html
   My bibliography  Save this item

Adaptive Game Playing Using Multiplicative Weights

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Gao, Kun & Sun, Lijun & Yang, Ying & Meng, Fanyu & Qu, Xiaobo, 2021. "Cumulative prospect theory coupled with multi-attribute decision making for modeling travel behavior," Transportation Research Part A: Policy and Practice, Elsevier, vol. 148(C), pages 1-21.
  2. Andriy Zapechelnyuk, 2009. "Limit Behavior of No-regret Dynamics," Discussion Papers 21, Kyiv School of Economics.
  3. Daskalakis, Constantinos & Deckelbaum, Alan & Kim, Anthony, 2015. "Near-optimal no-regret algorithms for zero-sum games," Games and Economic Behavior, Elsevier, vol. 92(C), pages 327-348.
  4. Josef Hofbauer & Sylvain Sorin & Yannick Viossat, 2009. "Time Average Replicator and Best-Reply Dynamics," Mathematics of Operations Research, INFORMS, vol. 34(2), pages 263-269, May.
  5. Nymisha Bandi & Theja Tulabandhula, 2020. "Off-Policy Optimization of Portfolio Allocation Policies under Constraints," Papers 2012.11715, arXiv.org.
  6. Mohammed Shahid Abdulla & Shalabh Bhatnagar, 2016. "Multi-armed bandits based on a variant of Simulated Annealing," Indian Journal of Pure and Applied Mathematics, Springer, vol. 47(2), pages 195-212, June.
  7. Schlag, Karl H. & Zapechelnyuk, Andriy, 2017. "Dynamic benchmark targeting," Journal of Economic Theory, Elsevier, vol. 169(C), pages 145-169.
  8. Sandroni, Alvaro & Smorodinsky, Rann, 2004. "Belief-based equilibrium," Games and Economic Behavior, Elsevier, vol. 47(1), pages 157-171, April.
  9. Karl Schlag & Andriy Zapechelnyuk, 2009. "Decision Making in Uncertain and Changing Environments," Discussion Papers 19, Kyiv School of Economics.
  10. Ewerhart, Christian & Valkanova, Kremena, 2020. "Fictitious play in networks," Games and Economic Behavior, Elsevier, vol. 123(C), pages 182-206.
  11. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
  12. Shie Mannor & Gilles Stoltz, 2009. "A Geometric Proof of Calibration," Working Papers hal-00442042, HAL.
  13. Maas, Benedikt, 2019. "Nowcasting and forecasting US recessions: Evidence from the Super Learner," MPRA Paper 96408, University Library of Munich, Germany.
  14. Tomáš Loveček & Lenka Straková & Katarína Kampová, 2021. "Modeling and Simulation as Tools to Increase the Protection of Critical Infrastructure and the Sustainability of the Provision of Essential Needs of Citizens," Sustainability, MDPI, vol. 13(11), pages 1-18, May.
  15. Farokhi, Farhad & Johansson, Karl H., 2015. "A piecewise-constant congestion taxing policy for repeated routing games," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 123-143.
  16. Du, Ye & Lehrer, Ehud, 2020. "Constrained no-regret learning," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 16-24.
  17. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2005. "Stochastic Approximations and Differential Inclusions; Part II: Applications," Working Papers hal-00242974, HAL.
  18. Schlag, Karl & Zapechelnyuk, Andriy, 2012. "On the impossibility of achieving no regrets in repeated games," Journal of Economic Behavior & Organization, Elsevier, vol. 81(1), pages 153-158.
  19. Viossat, Yannick & Zapechelnyuk, Andriy, 2013. "No-regret dynamics and fictitious play," Journal of Economic Theory, Elsevier, vol. 148(2), pages 825-842.
  20. Greg Lewis & Vasilis Syrgkanis, 2018. "Adversarial Generalized Method of Moments," Papers 1803.07164, arXiv.org, revised Apr 2018.
  21. Cheung, Yun Kuen & Cole, Richard & Devanur, Nikhil R., 2020. "Tatonnement beyond gross substitutes? Gradient descent to the rescue," Games and Economic Behavior, Elsevier, vol. 123(C), pages 295-326.
  22. repec:hal:wpaper:hal-00713871 is not listed on IDEAS
  23. Shie Mannor & Nahum Shimkin, 2003. "The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 327-345, May.
  24. Márton Gosztonyi & Csákné Filep Judit, 2022. "Profiling (Non-)Nascent Entrepreneurs in Hungary Based on Machine Learning Approaches," Sustainability, MDPI, vol. 14(6), pages 1-20, March.
  25. Emerson Melo, 2021. "Learning in Random Utility Models Via Online Decision Problems," Papers 2112.10993, arXiv.org, revised Aug 2022.
  26. Michel Benaïm & Josef Hofbauer & Sylvain Sorin, 2006. "Stochastic Approximations and Differential Inclusions, Part II: Applications," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 673-695, November.
  27. Yang Cai & Ozan Candogan & Constantinos Daskalakis & Christos Papadimitriou, 2016. "Zero-Sum Polymatrix Games: A Generalization of Minmax," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 648-655, May.
  28. Sergiu Hart & Andreu Mas-Colell, 2013. "A General Class Of Adaptive Strategies," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 3, pages 47-76, World Scientific Publishing Co. Pte. Ltd..
  29. Karl Schlag & Andriy Zapechelnyuk, 2010. "On the Impossibility of Regret Minimization in Repeated Games," Working Papers 676, Queen Mary University of London, School of Economics and Finance.
  30. Lisa Hellerstein & Thomas Lidbetter & Daniel Pirutinsky, 2019. "Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games," Operations Research, INFORMS, vol. 67(3), pages 731-743, May.
  31. Cominetti, Roberto & Melo, Emerson & Sorin, Sylvain, 2010. "A payoff-based learning procedure and its application to traffic games," Games and Economic Behavior, Elsevier, vol. 70(1), pages 71-83, September.
  32. Simina Br^anzei, 2019. "Tit-for-Tat Dynamics and Market Volatility," Papers 1911.03629, arXiv.org, revised Jan 2024.
  33. Yuichi Noguchi, 2009. "Note on universal conditional consistency," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 193-207, June.
  34. Jakub Bielawski & Thiparat Chotibut & Fryderyk Falniowski & Michal Misiurewicz & Georgios Piliouras, 2022. "Unpredictable dynamics in congestion games: memory loss can prevent chaos," Papers 2201.10992, arXiv.org, revised Jan 2022.
  35. Emerson Melo, 2021. "Learning In Random Utility Models Via Online Decision Problems," CAEPR Working Papers 2022-003 Classification-D, Center for Applied Economics and Policy Research, Department of Economics, Indiana University Bloomington.
  36. Jia Yuan Yu & Shie Mannor & Nahum Shimkin, 2009. "Markov Decision Processes with Arbitrary Reward Processes," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 737-757, August.
  37. Mario Bravo, 2016. "An Adjusted Payoff-Based Procedure for Normal Form Games," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1469-1483, November.
  38. Mannor, Shie & Shimkin, Nahum, 2008. "Regret minimization in repeated matrix games with variable stage duration," Games and Economic Behavior, Elsevier, vol. 63(1), pages 227-258, May.
  39. Panayotis Mertikopoulos & William H. Sandholm, 2016. "Learning in Games via Reinforcement and Regularization," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1297-1324, November.
  40. Hanyu Li & Wenhan Huang & Zhijian Duan & David Henry Mguni & Kun Shao & Jun Wang & Xiaotie Deng, 2023. "A survey on algorithms for Nash equilibria in finite normal-form games," Papers 2312.11063, arXiv.org.
  41. Shie Mannor & Gilles Stoltz, 2010. "A Geometric Proof of Calibration," Mathematics of Operations Research, INFORMS, vol. 35(4), pages 721-727, November.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.