scientific article

From MaRDI portal
Publication:3351186

zbMath0727.90105MaRDI QIDQ3351186

Ehud Kalai

Publication date: 1990


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

The complexity of interacting automataBounded computational capacity equilibriumComputing equilibria: a computational complexity perspectiveBounded rationality, strategy simplification, and equilibriumLimits of correlation in repeated games with bounded memoryDirected graphical structure, Nash equilibrium, and potential gamesOn finite strategy sets for finitely repeated zero-sum games.Randomization and simplification in dynamic decision-making.The role of information processing cost as the foundation of bounded rationality in game theoryArrow's theorem, countably many agents, and more visible invisible dictatorsSymmetric play in repeated allocation gamesFinite automata equilibria with discountingEquilibrium paths in discounted supergamesThe strength of a little perfectionAlgorithmic rationality: game theory with costly computationLimited focus in dynamic gamesA strong anti-folk theoremComputer science and decision theoryShould I remember more than you? Best responses to factored strategiesPerceptron versus automaton in the finitely repeated prisoner's dilemmaThe myth of the folk theoremRepeated games with one-memoryPartners or rivals? Strategies for the iterated prisoner's dilemmaReactive strategies: an inch of memory, a mile of equilibriaThe Big Match in Small SpaceStrategic entropy and complexity in repeated gamesThe core of a repeated \(n\)-person cooperative gameRepeated games with \(M\)-period bounded memory (pure strategies)Online concealed correlation and bounded rationalityLittle perfection and complexityComputability, complexity and economics




This page was built for publication: