Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
From MaRDI portal
Publication:2957451
DOI10.1287/opre.2016.1527zbMath1354.91083OpenAlexW227260172MaRDI QIDQ2957451
Frits C. R. Spieksma, Bram De Rock, Laurens Cherchye, Fabrice Talla Nobibon, Thomas Demuynck, Yves Cramer
Publication date: 26 January 2017
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/242287/3/023.pdf
global optimizationsimulated annealingrationalitymixed-integer programmingrevealed preference axioms
Related Items (5)
Inverse problems in economic measurements ⋮ Optimal Strategy of Social Responsibility and Quality Effort in Service Supply Chain with Quality Preference ⋮ Testing Pareto efficiency and competitive equilibrium in economies with public goods ⋮ Revealed preference theory: an algorithmic outlook ⋮ Complexity results for the weak axiom of revealed preference for collective consumption models
Cites Work
- Global optimization of statistical functions with simulated annealing
- The Nonparametric Approach to Demand Analysis
- Nonparametric tests of collectively rational consumption behavior: an integer programming procedure
- The computational complexity of rationalizing Pareto optimal choice behavior
- A note on testing axioms of revealed preference
- Heuristics for deciding collectively rational consumption behavior
- A new polynomial-time algorithm for linear programming
- New complexity results about Nash equilibria
- Good neighbors are hard to find: Computational complexity of network formation
- Computing the minimal covering set
- A computational analysis of the tournament equilibrium set
- The computational complexity of rationalizing behavior
- An Afriat theorem for the collective model of household consumption
- A survey on the complexity of tournament solutions
- Global optimization and simulated annealing
- Nash and correlated equilibria: Some complexity considerations
- On the NP-completeness of finding an optimal strategy in games with common payoffs
- On computational complexity of membership test in flow games and linear production games
- Finding a Nash equilibrium in spatial games is an NP-complete problem
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- On the complexity of achieving proportional representation
- Testable implications of general equilibrium models: an integer programming approach
- Class A Bézier curves
- Banks winners in tournaments are difficult to recognize
- On the complexity of testing the collective axiom of revealed preference
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
- Collective Household Consumption Behavior: Revealed Preference Analysis
- The Revealed Preference Approach to Collective Consumption Behaviour: Testing and Sharing Rule Recovery
- Efficient Intra-Household Allocations and Distribution Factors: Implications and Identification
- The Complexity of Rationalizing Matchings
- Rational Household Labor Supply
- Efficient Intra-Household Allocations: A General Characterization and Empirical Tests
- The Collective Model of Household Consumption: A Nonparametric Characterization
- Nonnegative Matrix Equations Having Positive Solutions
- The Construction of Utility Functions from Expenditure Data
- Afriat and Revealed Preference Theory
This page was built for publication: Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
