Testing Consumer Rationality Using Perfect Graphs and Oriented Discs
From MaRDI portal
Publication:3460788
DOI10.1007/978-3-662-48995-6_14zbMath1406.91096arXiv1507.07581OpenAlexW2244883558MaRDI QIDQ3460788
Shant Boodaghians, Adrian Vetta
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07581
Applications of graph theory (05C90) Individual preferences (91B08) Consumer behavior, demand theory (91B42)
Related Items (max. 100)
Revealed preference dimension via matrix sign rank ⋮ Revealed preference theory: an algorithmic outlook
Cites Work
- Unnamed Item
- On the hardness of approximating minimum vertex cover
- The strong perfect graph theorem
- A study on two geometric location problems
- Geometric algorithms and combinatorial optimization
- Packing directed circuits fractionally
- A geometric approach to revealed preference via Hamiltonian cycles
- The geometry of revealed preference
- Normal hypergraphs and the perfect graph conjecture
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
- Hardness of Vertex Deletion and Project Scheduling
- On the power of unique 2-prover 1-round games
- On a System of Inequalities in Demand Analysis: An Extension of the Classical Method
- The Construction of Utility Functions from Expenditure Data
This page was built for publication: Testing Consumer Rationality Using Perfect Graphs and Oriented Discs