A note on testing axioms of revealed preference (Q495751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonparametric Approach to Demand Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on alternating directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains / rank
 
Normal rank

Latest revision as of 19:11, 10 July 2024

scientific article
Language Label Description Also known as
English
A note on testing axioms of revealed preference
scientific article

    Statements

    A note on testing axioms of revealed preference (English)
    0 references
    0 references
    0 references
    0 references
    15 September 2015
    0 references
    generalized axiom of revealed preference
    0 references
    directed graph
    0 references
    strongly connected components
    0 references
    arc coloring
    0 references
    microeconomics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references