Economics at your fingertips  

Method of Digraphs for Multi-dimensional Screening

Sergey Kokovin and Babu Nahata ()
Additional contact information
Babu Nahata: University of Louisville

Annals of Operations Research, 2017, vol. 253, issue 1, No 19, 451 pages

Abstract: Abstract We study a general model of multi-dimensional screening for discrete types of consumers without the single-crossing condition or any other essential restrictions. Such generality motivates us to introduce graph theory into optimization by treating each combination of active constraints as a digraph. Our relaxation of the constraints (a slackness parameter) excludes bunching and cycles among the constraints. Then, the only possible solution structures are rivers, which are acyclic rooted digraphs, and the Lagrange multipliers can be used to characterize the solutions. Relying on these propositions, we propose and justify an optimization algorithm. In the experiments, its branch-and-bound version with a good starting plan shows fewer iterations than a complete search among all rivers.

Keywords: Lagrange Multiplier; Active Constraint; Participation Constraint; Reservation Utility; Nonlinear Price (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link) Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from

DOI: 10.1007/s10479-016-2320-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Page updated 2021-12-21
Handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2320-3