Payoff assessments without probabilities: a simple dynamic model of choice

DOI10.1006/GAME.1998.0702zbMath1115.91311OpenAlexW1985191333WikidataQ57918043 ScholiaQ57918043MaRDI QIDQ1304012

Rajiv Sarin, Farshid Vahid

Publication date: 5 December 1999

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.1998.0702

zbMATH Keywords

learningmaxminprocedural rationalitypayoff assessments without probabilities

Mathematics Subject Classification ID

Decision theory (91B06) Social choice (91B14) Decision theory for games (91A35)

Related Items (31)

Learning from inferred foregone payoffs ⋮ An experiment on learning with limited information: nonconvergence, experimentation cascades, and the advantage of being slow. ⋮ Q-learning agents in a Cournot oligopoly model ⋮ A note on adjusted replicator dynamics in iterated games ⋮ Congestion allocation for distributed networks: an experimental study ⋮ An adaptive learning model with foregone payoff information ⋮ Evaluating the reliance on past choices in adaptive learning models ⋮ Non-probabilistic decision making with memory constraints ⋮ Learning and equilibrium transitions: stochastic stability in discounted stochastic fictitious play ⋮ Characterizing cautious choice ⋮ Mean and variance responsive learning ⋮ An experiment on case-based decision making ⋮ Learning under limited information. ⋮ Dynamic nonlinear pricing model based on adaptive and sophisticated learning ⋮ Evaluating generalizability and parameter consistency in learning models ⋮ Decision rules with bounded memory ⋮ Generalized reinforcement learning in perfect-information games ⋮ Prospect dynamics and loss dominance ⋮ Predicting how people play games: A simple dynamic model of choice ⋮ Learning, information, and sorting in market entry games: theory and evidence ⋮ Analyzing behavior implied by EWA learning: an emphasis on distinguishing reinforcement from belief learning ⋮ Multi-object auctions with package bidding: an experimental comparison of Vickrey and iBEA ⋮ Foregone with the wind: Indirect payoff information and its implications for choice ⋮ Convergence results on stochastic adaptive learning ⋮ Economists' models of learning ⋮ Evolving market structure: An ACE model of price dispersion and loyalty ⋮ Attainability of boundary points under reinforcement learning ⋮ Learning to play games in extensive form by valuation ⋮ Learning aspiration in repeated games ⋮ An adaptive learning model in coordination games ⋮ Aspiration-based and reciprocity-based rules in learning dynamics for symmetric normal-form games

Cites Work

• Maximin, leximin, and the protective criterion: Characterizations and comparisons
• Maxmin expected utility with non-unique prior
• Case-based optimization
• Subjective games and equilibria
• Quantal response equilibria for normal form games
• Stochastic Choice and Cardinal Utility
• Analysis of recursive stochastic algorithms
• Case-Based Decision Theory
• "Beliefs about Beliefs" without Probabilities
• Predicting how people play games: A simple dynamic model of choice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Payoff assessments without probabilities: a simple dynamic model of choice