paper-with-me

Papers

Strategic Teaching and Learning in Games

2015-04-23 · Burkhard C. Schipper

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a player has an incentive to adopt, that would be evolutionary stable or that could "learn itself". Rather, a player has an incentive to strategically teach such a learning opponent in order secure at least the Stackelberg leader payoff. The impossibility result remains intact when restricted to the classes of generic games, two-player games, potential games, games with strategic complements or 2x2 games, in which learning is known to be "nice". More generally, it also applies to uncoupled learning heuristics leading to correlated equilibria, rationalizable outcomes, iterated admissible outcomes, or minimal curb sets. A possibility result restricted to "strategically trivial" games fails if some generic games outside this class are considered as well.

📄 PDF Abstract BibTeX arXiv:1504.06341

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments

2023-03-09 · Alan Kuhnle, Jeffrey Richley, Darleen Perez-Lavin

For general-sum, n-player, strategic games with transferable utility, the Harsanyi-Shapley value provides a computable method to both 1) quantify the strategic value of a player; and 2) make cooperation rational through …

FormQ-Learning

Conversation Games and a Strategic View of the Turing Test

2025-01-30 · Kaveh Aryan

Although many game-theoretic models replicate real interactions that often rely on natural language, explicit study of games where language is central to strategic interaction remains limited. This paper introduces the \…

Using HMM in Strategic Games

2014-04-01 · Mario Benevides, Isaque Lima, Rafael Nader, Pedro Rougemont

In this paper we describe an approach to resolve strategic games in which players can assume different types along the game. Our goal is to infer which type the opponent is adopting at each moment so that we can increase…

Parallel Algorithm for Approximating Nash Equilibrium in Multiplayer Stochastic Games with Application to Naval Strategic Planning

2019-10-01 · Sam Ganzfried, Conner Laughlin, Charles Morefield

Many real-world domains contain multiple agents behaving strategically with probabilistic transitions and uncertain (potentially infinite) duration. Such settings can be modeled as stochastic games. While algorithms have…

Strategic Prediction with Latent Aggregative Games

2019-05-29 · Vikas K. Garg, Tommi Jaakkola

We introduce a new class of context dependent, incomplete information games to serve as structured prediction models for settings with significant strategic interactions. Our games map the input context to outcomes by fi…

PredictionStructured Prediction