Optimal Transport Methods in Economics / / Alfred Galichon.

Optimal Transport Methods in Economics is the first textbook on the subject written especially for students and researchers in economics. Optimal transport theory is used widely to solve problems in mathematics and some areas of the sciences, but it can also be used to understand a range of problems...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2016
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2016]
©2017
Year of Publication:2016
Language:English
Online Access:
Physical Description:1 online resource (184 p.) :; 2 halftones. 5 line illus. 2 maps.
Tags: Add Tag
No Tags, Be the first to tag this record!
id 9781400883592
ctrlnum (DE-B1597)474355
(OCoLC)962029831
collection bib_alma
record_format marc
spelling Galichon, Alfred, author. aut http://id.loc.gov/vocabulary/relators/aut
Optimal Transport Methods in Economics / Alfred Galichon.
Princeton, NJ : Princeton University Press, [2016]
©2017
1 online resource (184 p.) : 2 halftones. 5 line illus. 2 maps.
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Frontmatter -- Contents -- Preface -- 1. Introduction -- 2. Monge-Kantorovich Theory -- 3. The Discrete Optimal Assignment Problem -- 4. One-Dimensional Case -- 5. Power Diagrams -- 6. Quadratic Surplus -- 7. More General Surplus -- 8. Transportation on Networks -- 9. Some Applications -- 10. Conclusion -- Appendix A. Solutions to the Exercises -- Appendix B. Linear Programming -- Appendix C. Quantiles and Copulas -- Appendix D. Basics of Convex Analysis -- Appendix E. McFadden's Generalized Extreme Value Theory -- References -- Index
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
Optimal Transport Methods in Economics is the first textbook on the subject written especially for students and researchers in economics. Optimal transport theory is used widely to solve problems in mathematics and some areas of the sciences, but it can also be used to understand a range of problems in applied economics, such as the matching between job seekers and jobs, the determinants of real estate prices, and the formation of matrimonial unions. This is the first text to develop clear applications of optimal transport to economic modeling, statistics, and econometrics. It covers the basic results of the theory as well as their relations to linear programming, network flow problems, convex analysis, and computational geometry. Emphasizing computational methods, it also includes programming examples that provide details on implementation. Applications include discrete choice models, models of differential demand, and quantile-based statistical estimation methods, as well as asset pricing models.Authoritative and accessible, Optimal Transport Methods in Economics also features numerous exercises throughout that help you develop your mathematical agility, deepen your computational skills, and strengthen your economic intuition.The first introduction to the subject written especially for economistsIncludes programming examplesFeatures numerous exercises throughoutIdeal for students and researchers alike
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)
Economics Mathematical models.
Economics, Mathematical.
Economics; Mathematical models.
Mathematical optimization.
Transportation problems (Programming).
BUSINESS & ECONOMICS / Economics / Microeconomics. bisacsh
Monge problem.
MongeЋantorovich problem.
applied economics.
computation.
computational geometry.
convex analysis.
dual minimizers.
dual problem.
duality.
econometrics.
economic modeling.
economic output.
economics.
equilibrium transport.
generalized convexity.
hedonic equilibria.
inversion demand.
linear programming.
marginal probability distributions.
matching surplus.
network flow problems.
optimal assignment.
optimal network flow.
optimal transport theory.
optimal transport.
polar factorization theorem.
positive assortative matching.
primal problem.
quantile regression.
quantile transform.
statistics.
worker assignment.
worker distribution.
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2016 9783110638592
print 9780691172767
https://doi.org/10.1515/9781400883592?locatt=mode:legacy
https://www.degruyter.com/isbn/9781400883592
Cover https://www.degruyter.com/cover/covers/9781400883592.jpg
language English
format eBook
author Galichon, Alfred,
Galichon, Alfred,
spellingShingle Galichon, Alfred,
Galichon, Alfred,
Optimal Transport Methods in Economics /
Frontmatter --
Contents --
Preface --
1. Introduction --
2. Monge-Kantorovich Theory --
3. The Discrete Optimal Assignment Problem --
4. One-Dimensional Case --
5. Power Diagrams --
6. Quadratic Surplus --
7. More General Surplus --
8. Transportation on Networks --
9. Some Applications --
10. Conclusion --
Appendix A. Solutions to the Exercises --
Appendix B. Linear Programming --
Appendix C. Quantiles and Copulas --
Appendix D. Basics of Convex Analysis --
Appendix E. McFadden's Generalized Extreme Value Theory --
References --
Index
author_facet Galichon, Alfred,
Galichon, Alfred,
author_variant a g ag
a g ag
author_role VerfasserIn
VerfasserIn
author_sort Galichon, Alfred,
title Optimal Transport Methods in Economics /
title_full Optimal Transport Methods in Economics / Alfred Galichon.
title_fullStr Optimal Transport Methods in Economics / Alfred Galichon.
title_full_unstemmed Optimal Transport Methods in Economics / Alfred Galichon.
title_auth Optimal Transport Methods in Economics /
title_alt Frontmatter --
Contents --
Preface --
1. Introduction --
2. Monge-Kantorovich Theory --
3. The Discrete Optimal Assignment Problem --
4. One-Dimensional Case --
5. Power Diagrams --
6. Quadratic Surplus --
7. More General Surplus --
8. Transportation on Networks --
9. Some Applications --
10. Conclusion --
Appendix A. Solutions to the Exercises --
Appendix B. Linear Programming --
Appendix C. Quantiles and Copulas --
Appendix D. Basics of Convex Analysis --
Appendix E. McFadden's Generalized Extreme Value Theory --
References --
Index
title_new Optimal Transport Methods in Economics /
title_sort optimal transport methods in economics /
publisher Princeton University Press,
publishDate 2016
physical 1 online resource (184 p.) : 2 halftones. 5 line illus. 2 maps.
Issued also in print.
contents Frontmatter --
Contents --
Preface --
1. Introduction --
2. Monge-Kantorovich Theory --
3. The Discrete Optimal Assignment Problem --
4. One-Dimensional Case --
5. Power Diagrams --
6. Quadratic Surplus --
7. More General Surplus --
8. Transportation on Networks --
9. Some Applications --
10. Conclusion --
Appendix A. Solutions to the Exercises --
Appendix B. Linear Programming --
Appendix C. Quantiles and Copulas --
Appendix D. Basics of Convex Analysis --
Appendix E. McFadden's Generalized Extreme Value Theory --
References --
Index
isbn 9781400883592
9783110638592
9780691172767
callnumber-first H - Social Science
callnumber-subject HB - Economic Theory and Demography
callnumber-label HB143
callnumber-sort HB 3143.7
url https://doi.org/10.1515/9781400883592?locatt=mode:legacy
https://www.degruyter.com/isbn/9781400883592
https://www.degruyter.com/cover/covers/9781400883592.jpg
illustrated Illustrated
dewey-hundreds 300 - Social sciences
dewey-tens 330 - Economics
dewey-ones 330 - Economics
dewey-full 330.015196
dewey-sort 3330.015196
dewey-raw 330.015196
dewey-search 330.015196
doi_str_mv 10.1515/9781400883592?locatt=mode:legacy
oclc_num 962029831
work_keys_str_mv AT galichonalfred optimaltransportmethodsineconomics
status_str n
ids_txt_mv (DE-B1597)474355
(OCoLC)962029831
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2016
is_hierarchy_title Optimal Transport Methods in Economics /
container_title Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2016
_version_ 1806143645896671232
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05975nam a22011895i 4500</leader><controlfield tag="001">9781400883592</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20162017nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1004872050</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)988081944</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400883592</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400883592</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)474355</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)962029831</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">HB143.7</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">BUS044000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330.015196</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Galichon, Alfred, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal Transport Methods in Economics /</subfield><subfield code="c">Alfred Galichon.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (184 p.) :</subfield><subfield code="b">2 halftones. 5 line illus. 2 maps.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">1. Introduction -- </subfield><subfield code="t">2. Monge-Kantorovich Theory -- </subfield><subfield code="t">3. The Discrete Optimal Assignment Problem -- </subfield><subfield code="t">4. One-Dimensional Case -- </subfield><subfield code="t">5. Power Diagrams -- </subfield><subfield code="t">6. Quadratic Surplus -- </subfield><subfield code="t">7. More General Surplus -- </subfield><subfield code="t">8. Transportation on Networks -- </subfield><subfield code="t">9. Some Applications -- </subfield><subfield code="t">10. Conclusion -- </subfield><subfield code="t">Appendix A. Solutions to the Exercises -- </subfield><subfield code="t">Appendix B. Linear Programming -- </subfield><subfield code="t">Appendix C. Quantiles and Copulas -- </subfield><subfield code="t">Appendix D. Basics of Convex Analysis -- </subfield><subfield code="t">Appendix E. McFadden's Generalized Extreme Value Theory -- </subfield><subfield code="t">References -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Optimal Transport Methods in Economics is the first textbook on the subject written especially for students and researchers in economics. Optimal transport theory is used widely to solve problems in mathematics and some areas of the sciences, but it can also be used to understand a range of problems in applied economics, such as the matching between job seekers and jobs, the determinants of real estate prices, and the formation of matrimonial unions. This is the first text to develop clear applications of optimal transport to economic modeling, statistics, and econometrics. It covers the basic results of the theory as well as their relations to linear programming, network flow problems, convex analysis, and computational geometry. Emphasizing computational methods, it also includes programming examples that provide details on implementation. Applications include discrete choice models, models of differential demand, and quantile-based statistical estimation methods, as well as asset pricing models.Authoritative and accessible, Optimal Transport Methods in Economics also features numerous exercises throughout that help you develop your mathematical agility, deepen your computational skills, and strengthen your economic intuition.The first introduction to the subject written especially for economistsIncludes programming examplesFeatures numerous exercises throughoutIdeal for students and researchers alike</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Economics</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Economics, Mathematical.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Economics; Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Mathematical optimization.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Transportation problems (Programming).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">BUSINESS &amp; ECONOMICS / Economics / Microeconomics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Monge problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">MongeЋantorovich problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">applied economics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational geometry.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">convex analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dual minimizers.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dual problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">duality.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">econometrics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">economic modeling.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">economic output.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">economics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">equilibrium transport.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">generalized convexity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hedonic equilibria.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">inversion demand.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">marginal probability distributions.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">matching surplus.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network flow problems.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">optimal assignment.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">optimal network flow.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">optimal transport theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">optimal transport.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">polar factorization theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">positive assortative matching.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">primal problem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantile regression.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">quantile transform.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">statistics.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">worker assignment.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">worker distribution.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press Complete eBook-Package 2016</subfield><subfield code="z">9783110638592</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691172767</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400883592?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400883592</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400883592.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-063859-2 Princeton University Press Complete eBook-Package 2016</subfield><subfield code="b">2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_LAEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_LAEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESSHALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_SSHALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA11SSHE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA17SSHEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>