Search arXiv⌕ Search

arXiv · 2610.08096

The lattice structure of the crawler

Abstract

We study object reallocation problems with single-peaked preferences. On the unrestricted domain of strict preferences, top trading cycles (TTC) is the unique rule that satisfies efficiency, individual rationality, and strategy-proofness. On the single-peaked preference domain, the crawler introduced by Bade (2019) satisfies the same properties. We show that the Nash equilibrium allocations of the crawler's direct revelation game form a complete lattice under weak Pareto dominance. The truthful allocation is the greatest element of this lattice, while the initial endowment allocation is its least element.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hinata Kurashita. 2026-10-06. The lattice structure of the crawler. https://arxiv.org/abs/2610.08096

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Social networks, confirmation bias and shock elections

This paper links the increasing prominence of social networks in politics to recent shock election outcomes. In our setup, agents learning on a network suffer from confirmation bias -- the tendency to ignore contrary evidence to ones own belief. Our main result is that confirmation bias slows down learning in a wide class of networks. For any network, consensus fails to emerge when confirmation bias is above a threshold. We explore the implications for elections and media markets. Confirmation bias increases the likelihood of shock elections, and encourages media organizations already at the fringe to take on even more extreme views.

econ.TH↗

Screening with Discrete Types and Discrete Contracts

We study screening when both the agent's types and the contracts available to the principal are finite: Quantities and transfers are drawn from a finite integer grid, while marginal costs lie on a slightly off-set grid, with integer costs as a limit case. We compare two solution concepts, equilibrium and rationalizability. Since rationalizability does not feature an equilibrium tie-breaking convention, we analyze screening under weak and under strict incentives. We develop a discrete first-order approach and characterize the optimal menus for full-support log-concave beliefs. Optimal quantities need not be unique, but at most two adjacent quantities are optimal and multiplicity is a knife-edge case in beliefs. Our rationalizability solution concept, Delta-O rationalizability, restricts the principal's beliefs over types and requires her best replies to be robust to belief perturbations. Two rounds of elimination suffice, and the rationalizable and the equilibrium outcomes essentially coincide: The predictions of equilibrium survive without a common prior, while avoiding a tie-breaking convention.

econ.TH↗

Reduced Forms: Feasibility, Extremality, Optimality

We study independent private values auction settings with heterogeneous bidders, revenue nonlinear in interim winning probabilities, and place no ad hoc restrictions on auctions that a seller can use. We show that feasibility of interim winning probabilities is testable along a unidimensional principal curve, constructed in closed form. We then explicitly characterize the extreme points of the feasible set and the allocations that induce them. Combining these results, we solve for the optimal auction under a natural regularity condition. The optimal auction equalizes bidders' marginal revenues along its principal curve and awards the good to the bidder whose type the curve reaches first. Revenue curvature determines whether and how low types are excluded---at the intensive margin, scaling winning probabilities down, or the extensive margin, cutting them off. Applications include the linear model, endogenous valuations from ex ante investments, and non-expected utility preferences, where previous results were largely limited to symmetric environments and allocations or two bidders.

econ.TH↗