Combinatorial Discrete Choice

Fabian Eckert and Costas Arkolakis

No 249, 2017 Meeting Papers from Society for Economic Dynamics

Abstract: Combinatorial problems are prevalent in economics but the large dimensionality of potential solutions substantially limits the scope of their applications. We define and characterize a general class that we term combinatorial discrete choice problems and show that it incorporates existing problems in economics and engineering. We prove that intuitive sufficient conditions guarantee the existence of simple recursive procedures that can be used to identify the global maximum. We propose such an algorithm and show how it can be used to revisit problems whose computation was deemed infeasible before. We finally discuss results for a class of games characterized by these sufficient conditions.

Date: 2017
New Economics Papers: this item is included in nep-dcm, nep-des, nep-dge and nep-ecm
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
https://red-files-public.s3.amazonaws.com/meetpapers/2017/paper_249.pdf (application/pdf)

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: https://EconPapers.repec.org/RePEc:red:sed017:249

Access Statistics for this paper

More papers in 2017 Meeting Papers from Society for Economic Dynamics Society for Economic Dynamics Marina Azzimonti Department of Economics Stonybrook University 10 Nicolls Road Stonybrook NY 11790 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Christian Zimmermann ().