Ironing allocations
I propose a new approach to solving standard screening problems when the monotonicity constraint binds. A simple geometric argument shows that when virtual values are quasi-concave, the optimal allocation can be found by appropriately truncating the solution to the relaxed problem. I provide a simple algorithm for finding this optimal truncation when virtual values are concave.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Robotic Ironing with 3D Perception and Force/Torque Feedback in Household Environments
As robotic systems become more popular in household environments, the complexity of required tasks also increases. In this work we focus on a domestic chore deemed dull by a majority of the population, the task of ironin…
Multivariate Majorization in Principal-Agents Models
We introduce a definition of multivariate majorization that is new to the economics literature. Our majorization technique allows us to generalize Mussa and Rosen's (1978) "ironing" to a broad class of multivariate princ…
Decision MakingEnvy-freeness up to one item: Shall we add or remove resources?
We consider a fair division model in which agents have general valuations for bundles of indivisible items. We propose two new axiomatic properties for allocations in this model: EF1+- and EFX+-. We compare these with th…
Channel Estimation with Reduced Phase Allocations in RIS-Aided Systems
We consider channel estimation in systems equipped with a reconfigurable intelligent surface (RIS). In order to illuminate the additional cascaded channel as compared to systems without a RIS, commonly an unaffordable am…
EFX Allocations Exist for Binary Valuations
We study the fair division problem and the existence of allocations satisfying the fairness criterion envy-freeness up to any item (EFX). The existence of EFX allocations is a major open problem in the fair division lite…
Fairness