The Limits of Search Algorithms
A platform commits to a search algorithm that maps prices to search order. Given this algorithm, sellers set prices, and consumers engage in sequential search. This framework generalizes the ordered search literature. We introduce a special class of search algorithms, termed ''contracts,'' show that they implement all possible equilibrium prices and then characterize the set of implementable prices. Within this set, we identify the seller-optimal contract, whose first-best outcome remains an open problem for a multiproduct seller. Our findings highlight the conditions under which the platform favors price dispersion or price symmetry. Furthermore, we characterize the consumer-optimal and socially optimal contracts, which exert opposing forces to the seller-optimal contract: while the seller-optimal contract promotes higher prices, the consumer-optimal and socially optimal contracts favor lower prices.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Viral Search algorithm
The article, after a brief introduction on genetic algorithms and their functioning, presents a kind of genetic algorithm called Viral Search. We present the key concepts, we formally derive the algorithm and we perform …
Theoretical Analysis of Meta Reinforcement Learning: Generalization Bounds and Convergence Guarantees
This research delves deeply into Meta Reinforcement Learning (Meta RL) through a exploration focusing on defining generalization limits and ensuring convergence. By employing a approach this article introduces an innovat…
Generalization BoundsMeta Reinforcement LearningRAGLAB: A Modular and Research-Oriented Unified Framework for Retrieval-Augmented Generation
Large Language Models (LLMs) demonstrate human-level capabilities in dialogue, reasoning, and knowledge retention. However, even the most advanced LLMs face challenges such as hallucinations and real-time updating of the…
RAGRetrievalRetrieval-augmented GenerationEstimating the Fundamental Limits is Easier than Achieving the Fundamental Limits
We show through case studies that it is easier to estimate the fundamental limits of data processing than to construct explicit algorithms to achieve those limits. Focusing on binary classification, data compression, and…
Binary ClassificationData CompressionGeneral ClassificationGraph Instance Landscapes: When Structural Similarity Does (Not) Reflect Shortest-Path Performance
Benchmarking shortest-path algorithms is commonly based on aggregate performance over heterogeneous graph sets, which limits insight into how different search paradigms react to instance structure. We adopt an instance-l…