The computational complexity of rationalizing boundedly rational choice behavior (Q2427841): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997365851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice by sequential procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of rationalizing behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good neighbors are hard to find: Computational complexity of network formation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Nash equilibrium in spatial games is an NP-complete problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the minimal covering set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of the tournament equilibrium set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of stable partitions with b-preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testable implications of general equilibrium models: an integer programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of finding an optimal strategy in games with common payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash rationalization of collective choice over lotteries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakened WARP and top-cycle choice rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computational complexity of membership test in flow games and linear production games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationality and order-dependent sequential rationality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the complexity of tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizing Choice Functions By Multiple Rationales / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Rationalizing Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The testable implications of zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational choice with status quo bias / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of achieving proportional representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game theory via revealed preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revealed Preference Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the testable implications of collective choice theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for deciding collectively rational consumption behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rationalizability of choice functions by game trees / rank
 
Normal rank

Latest revision as of 02:43, 5 July 2024

scientific article
Language Label Description Also known as
English
The computational complexity of rationalizing boundedly rational choice behavior
scientific article

    Statements

    The computational complexity of rationalizing boundedly rational choice behavior (English)
    0 references
    0 references
    18 April 2012
    0 references
    0 references
    boundedly rational choice
    0 references
    rationalization by multiple rationales
    0 references
    sequential rationalization
    0 references
    rationalization by game trees
    0 references
    status-quo bias
    0 references
    computational complexity
    0 references
    \(\mathbf {NP}\)-completeness
    0 references
    0 references
    0 references
    0 references