Identifying Conduct Parameters with Separable Demand: A Counterexample to Lau (1982)
We provide a counterexample to the conduct parameter identification result established in the foundational work of Lau (1982), which generalizes the identification theorem of Bresnahan (1982) by relaxing the linearity assumptions. We identify a separable demand function that still permits identification and validate this case both theoretically and through numerical simulations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimized Separable Convolution: Yet Another Efficient Convolution Operator
The convolution operation is the most critical component in recent surge of deep learning research. Conventional 2D convolution needs O(C^{2}K^{2}) parameters to represent, where C is the channel size and K is the kernel…
Rethinking Convolution: Towards an Optimal Efficiency
In this paper, we present our recent research about the computational efficiency in convolution. Convolution operation is the most critical component in recent surge of deep learning research. Conventional 2D convolution…
Computational EfficiencyLearning to Disprove: Formal Counterexample Generation with Large Language Models
Mathematical reasoning demands two critical, complementary skills: constructing rigorous proofs for true statements and discovering counterexamples that disprove false ones. However, current AI efforts in mathematics foc…
Mathematical ReasoningA note on global identification in structural vector autoregressions
In a landmark contribution to the structural vector autoregression (SVARs) literature, Rubio-Ramirez, Waggoner, and Zha (2010, `Structural Vector Autoregressions: Theory of Identification and Algorithms for Inference,' R…
Counterexample Guided Learning in the Large using Reasoning Agents
LLMs and LLM agents should improve when given feedback, but identifying when they are able to do so is difficult: feedback is heterogeneous, domain-specific, and difficult to control. We approach this challenge by asking…
Program Synthesis