- Computational Complexity and Human Decision|Making🔍
- Goodness of Fit Measures for Revealed Preference Tests🔍
- The Complexity of Nash Rationalizability🔍
- Mutually consistent revealed preference bounds🔍
- measuring rationality with the minimum cost of revealed🔍
- Testing Axioms of Revealed Preference in Stata Marcos Demetry ...🔍
- Technical note🔍
- Algorithmic Game Theory and Computational Social Choice🔍
A Revealed Preference Approach to Computational Complexity in ...
Computational Complexity and Human Decision-Making - Cell Press
The principle does not take into account the difficulty of finding the best option. Here, we propose that computational complexity theory (CCT) provides a ...
... revealed preference test: The computational complexity of the ... Diewert, W.E. (1973) “Afriat and revealed preference theory” The Review of ...
Goodness of Fit Measures for Revealed Preference Tests
We provide results on the computational complexity of goodness of t measures (i.e. Afriat's efficiency index, Varian's efficiency vector-index and the ...
The Complexity of Nash Rationalizability - Lawrence University Faculty
We use results from descriptive complexity theory to explain the implications of our theorems for revealed preference theory for games. Key words: Nash ...
Mutually consistent revealed preference bounds - EconStor
The computational complexity of the MIP characterisation of the sufficient sup- ... giving possibilities for reducing the computational burden of the method.
measuring rationality with the minimum cost of revealed - jstor
One issue with MCI is computational complexity ... the cost of a revealed preference cycle is the total cost of ... "The Revealed Preference Approach to Demand," ...
Testing Axioms of Revealed Preference in Stata Marcos Demetry ...
Abstract. The revealed preference approach in economics is central to the em- pirical analysis of consumer behavior. This paper introduces the Stata ...
Technical note: “Bit by bit”: a practical and general approach for ...
We further demonstrate that for each model, the bit counts for computational complexity exceed those for performance by several orders of ...
Algorithmic Game Theory and Computational Social Choice - IMS
We show that efficiency and strategyproofness are incompatible to some extent when preferences are defined using stochastic dominance (SD) and therefore ...
Notes on Computational Complexity of GE Inequalities - EliScholar
manifold, using the theory of revealed preference and the consumer's smooth, convex indirect utility function, V ( p. I. ). (2) That is, they introduced the ...
6.853: Topics in Algorithmic Game Theory, Fall 2011 - People
Complexity theory of total search problems ... Description method vs computational complexity in ... Weak-Axiom of Revealed Preferences (WARP).ppt ...
Computational complexity drives sustained deliberation - Nature
Computational complexity theory is a branch of computer science that focuses on characterizing the difficulty of solving computational problems, ...
The Computational Complexity of the Housing Market - arXiv
Our main result has implications for economic theory, computation and market design more broadly, as the housing market model is a key building ...
Goodness of fit measures for revealed preference tests - Lirias
computational complexity of methods for testing GARP and the other revealed preference axioms ... The nonparametric approach to demand analysis.
Uncertainty and computational complexity - Journals
Firstly, it assumes that a decision-maker always has well-defined preferences in those situations in which the framework is applied [2].
Computational Complexity : A Modern Approach by Boaz Barak ...
We are independent online bookstore, we provide you the best offer in the books of your preference, a great book can change your life.
Computational Complexity Theory - Perficient Blogs
The Big Ω, and Big θ notations are used to describe the asymptotic behavior of an algorithm as a function of the input size. In computer science ...
Thomas Demuynck - Google Sites
10, 51-65. The computational complexity of ... 121, 1073-1096. The computational complexity ... Book Chapters. Samuelson's approach to revealed preference theory: ...
Cambridge Core - Statistical Theory and Methods - Revealed Preference Theory.
The Revealed Preference Approach to Demand - GARP
In principle, the estimated demand models can then be used (i) to test consistency of the data with the theory of consumer behavior, (ii) to infer consumer ...