Heuristics for Deciding Collectively Rational Consumption Behavior

Authors:
Fabrice Talla Nobibon;Laurens Cherchye;Bram De Rock;Jeroen Sabbe;Frits C. Spieksma
Affiliations:
Operations Research Group, University of Leuven, Leuven, Belgium 3000;CentER, and University of Leuven, Campus Kortrijk and Center for Economic Studies, Tilburg University, Kortrijk, Belgium 8500;ECARES and ECORE, Université Libre de Bruxelles, Brussels, Belgium 1050;Campus Kortrijk and Center for Economic Studies, University of Leuven, Kortrijk, Belgium 8500;Operations Research Group, University of Leuven, Leuven, Belgium 3000
Venue:
Computational Economics
Year:
2011

Citing 3
Cited 2

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Efficient algorithms for acyclic colorings of graphs

Theoretical Computer Science
Analyzing Cost-Efficient Production Behavior Under Economies of Scope: A Nonparametric Methodology

Operations Research

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

INFORMS Journal on Computing
Goodness-of-Fit Measures for Revealed Preference Tests: Complexity Results and Algorithms

ACM Transactions on Economics and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a directed graph for testing whether observed household consumption behavior satisfies the Collective Axiom of Revealed Preferences (CARP). More precisely, the data satisfy CARP if the graph allows a node-partitioning into two induced subgraphs that are acyclic. We prove that partitioning the obtained graph into two acyclic subgraphs is NP-complete. Next, we derive a necessary condition for CARP that can be verified in polynomial time, and we present an example to show that our necessary and sufficient conditions do not coincide. We also propose and implement fast heuristics for testing the sufficient condition. These heuristics can be used to check reasonably large data sets for CARP, and can be of particular interest when used prior to computationally demanding approaches. Finally, based on computational results for both real-life and synthetic data, we conclude that our heuristics are effective in testing CARP.