The computational complexity of rationalizing boundedly rational choice behavior
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Theorem on Boolean Matrices
- A computational analysis of the tournament equilibrium set
- A survey on the complexity of tournament solutions
- Banks winners in tournaments are difficult to recognize
- Choice by sequential procedures
- Computational complexity of stable partitions with b-preferences
- Computing the minimal covering set
- Finding a Nash equilibrium in spatial games is an NP-complete problem
- Game theory via revealed preferences
- Good neighbors are hard to find: Computational complexity of network formation
- Heuristics for deciding collectively rational consumption behavior
- Nash and correlated equilibria: Some complexity considerations
- Nash rationalization of collective choice over lotteries
- New complexity results about Nash equilibria
- On computational complexity of membership test in flow games and linear production games
- On the NP-completeness of finding an optimal strategy in games with common payoffs
- On the complexity of achieving proportional representation
- On the testable implications of collective choice theories
- Partially Ordered Sets
- Rational choice with status quo bias
- Rationality and order-dependent sequential rationality
- Rationalizability of choice functions by game trees
- Rationalizing Choice Functions By Multiple Rationales
- Revealed Preference Theory
- Testable implications of general equilibrium models: an integer programming approach
- The Complexity of Rationalizing Matchings
- The computational complexity of rationalizing behavior
- The testable implications of zero-sum games
- Weakened WARP and top-cycle choice rules
Cited in
(16)- Descriptive complexity and revealed preference theory
- Rationalization of indecisive choice behavior by pluralist ballots
- A behavioral choice model when computational ability matters
- BRA: an algorithm for simulating bounded rational agents
- The computational complexity of rationalizing Pareto optimal choice behavior
- Minimal rationalizations
- Rational analysis, intractability, and the prospects of `as if'-explanations
- Sources of complexity in subset choice
- The computational complexity of rationalizing behavior
- The sequential choice model: a rationality analysis
- Boundedly rational search with positive search costs
- Bounded rationality and search over small-world models
- scientific article; zbMATH DE number 7730634 (Why is no real title available?)
- scientific article; zbMATH DE number 3961285 (Why is no real title available?)
- Complexity results for the weak axiom of revealed preference for collective consumption models
- Sequential rationalization of multivalued choice
This page was built for publication: The computational complexity of rationalizing boundedly rational choice behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2427841)
