Searcharxiv⌕ Search

arXiv · 2610.32958

Information Requirements for Resolving Implementation Impossibilities

Abstract

We develop a framework for assessing implementation impossibilities through the information required to resolve them. Domain covers describe information used to select a mechanism without restricting admissible preferences. Coarsening a cover weakens the required information. In quasi-linear public decision problems with a status quo, we study two impossibilities of dominant-strategy implementation: combining efficiency and individual rationality with either budget feasibility or budget balancedness. Under an interval cover based on bounds on maximal social surplus, we characterize the social choice rules implementable in dominant strategies and satisfying the first set of axioms. Under a surplus-level cover based on exact surplus levels, we obtain the corresponding characterization for the second set of axioms. Both covers are minimal: no strictly coarser cover permits implementation under the respective requirements. These economically interpretable minimal covers deepen our understanding of the informational severity of each impossibility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuta Nakamura. 2026-10-23. Information Requirements for Resolving Implementation Impossibilities. https://arxiv.org/abs/2610.32958

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

KEEP EXPLORING

Related papers

Rational Learning One Step Off the Path

We study how endogenous learning shapes beliefs and strategies in extensive-form games. We adopt the overlapping-generations model of \citet{FL1993}, in which finitely lived Bayesian agents are randomly matched, observe only the outcomes of their own matches, and choose dynamically optimal strategies. We study limiting strategy profiles in steady states as agents become arbitrarily long lived and patient. We show that learning disciplines beliefs and strategies in subgames reached after a single deviation from the path of play. In particular, we establish the converse of \citet{FL2006}, showing that such limiting strategy profiles must be path-equivalent to subgame-confirmed equilibria.

econ.TH↗

Optimal Random Taxation

We consider the Ramsey problem of optimal government policy and give examples where lotteries are essential for the optimal solution. When markets are complete and the representative agent's coefficient of relative prudence is bounded, lotteries are typically not optimal. For the incomplete markets case, we prove analytically that lotteries improve welfare for some calibrations with CRRA utility, and we give a simple numerical example for this claim. When the agent's coefficient of relative risk aversion is unbounded for small consumption, lotteries typically improve welfare and can be used to approximate the first-best solution arbitrarily well in both the complete and the incomplete markets cases. However, in the complete markets case, when debt constraints are not too tight and the representative agent is sufficiently patient, lotteries can be purified in the sense that there is a deterministic solution that gives the same value.

econ.TH↗

A metric on solutions of the bargaining problem

We consider the classic bargaining problem: two players have to agree on a `fair' division $(x,y) \in Ω\subset \mathbb{R}_{\geq 0}^2$ which results in Player 1 receiving $x$ and Player 2 receiving $y$. The usual approach to this problem has been to impose a number of desirable axioms that a fair division should have and then conclude that the solution is uniquely defined by the axioms. We take an orthogonal view, avoid the discussion of axioms, and ask whether different and contradicting axioms may give rise to similar solutions. To this end, we define a natural metric on the space of solutions to the bargaining problem. The metric shows a strong internal consistency between the three celebrated solutions due to Nash (1950), Raiffa (1953) and Kalai-Smorodinsky (1975). It identifies problematic cases for the Utilitarian solution and the Perles-Maschler solution (1981). The area monotonic solution of Anbarci-Bigelow (1988) is shown to be nearly perfectly located on a shortest path from Nash to Kalai-Smorodinsky.

econ.TH↗