Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 17 September 2019

Abstract and Keywords

This chapter reviews agent-based models of land use change (ABM/LUCC), a new class of computational simulation models that directly represent the decisions and interactions of economic agents at the scale of real-world land management, over a spatially explicit and dynamic virtual landscape. The chapter provides practical guidance and context for land economists who wish to understand, evaluate, and construct ABM/LUCC. It explains their structure in relation to standard economic models and demonstrates how this structure facilitates investigation of novel economic questions, especially those that involve spatial and agent-level heterogeneity in combination. It outlines the novel issues that need to be considered for ABM/LUCC, including but not limited to land market issues such as nonequilibrium dynamics, price expectations, and bounded rationality. It discusses experimental design and analysis challenges unique to ABM models, highlights complementarities between ABM/LUCC and other methods, and outlines important future research directions for this field.

Keywords: agent-based models, computational economics, land markets, land use change, bounded rationality

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.