{"paper_id":"2411.07732","title":"Implementing Dynamic Pricing Across Multiple Pricing Groups in Real Estate","authors":["Lev Razumovskiy","Mariya Gerasimova","Nikolay Karenin","Mikhail Safro"],"paper_date":"2024-11-12","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2411.07732v1","page_url":"https://thequant.space/flowcharts/implementing-dynamic-pricing-across-multiple-pricing-groups/","scores":{"empirical_rigor":2,"math_complexity":8,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a mathematical model of dynamic pricing for real estate that incorporates multiple pricing groups, along with methods for distributing aggregate cumulative revenue across these groups and algorithms for constructing pricing policies.","quote":"This article presents a mathematical model of dynamic pricing for real estate (RE) that incorporates multiple pricing groups, thereby expanding the capabilities of existing models. The main contribution of this work lies in the development of a mathematical model that incorporates multiple real estate pricing groups, each with its own pricing policy and demand function.","summary":"This article presents a mathematical model of dynamic pricing for real estate (RE) that incorporates multiple pricing groups, thereby expanding the capabilities of existing models. The developed model solves the problem of maximizing aggregate cumulative revenue at the end of the sales period while…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Pricing policies are constant over intervals between constraint times and only change when constraints are strictly met.","type":"model","stated":"explicit","quote":"Therefore, by Theorem 1, with constraints on intermediate sales, the price must be constant over the interval, so for t ∈[τj−1, τj], the pricing policy (p1(t), . . . , pk(t)) will contain of constant prices.","support":"full"},{"assumption":"Sales and aggregate cumulative revenue constraints are set at fixed moments in time (τ0 < τ1 < … < τl = T).","type":"model","stated":"explicit","quote":"3 Additionally, when determining pricing policy, it is necessary to take into account several constraints on both the total quantity of RE objects sold within each pricing group and the aggregate cumulative revenue from the sales of RE objects across all available pricing groups.","support":"full"},{"assumption":"The demand functions for each pricing group are linear in price.","type":"market","stated":"explicit","quote":"The demand for each pricing group is assumed to be linear with the following law: for the first pricing group      300, if a1 −b1 · p > 300, 0, if a1 −b1 · p < 0, 300 · (a1 −b1 · p), otherwise, and for the second pricing group      500, if a2 −b2 · p > 500, 0, if a2 −b2 · p < 0, 500 · (a2 −b2 · p), otherwise.","support":"full"},{"assumption":"The time value of money and the increase in real‑estate object value as construction progresses are incorporated via a generalized factor ζ(t).","type":"model","stated":"explicit","quote":"Furthermore, this article proposes a modification of the basic model to include the time value of money and the RE objects value increase as construction progresses, making the model more applicable to real-world market conditions.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Synthetic simulation of two pricing groups (one‑bedroom and two‑bedroom apartments)","provider":null,"kind":"synthetic","access":"unknown","period":"sales period T = 10","universe":"two pricing groups","quote":"It is assumed that during the sales period T = 10, RE objects from two pricing groups are sold: one-bedroom and two-bedroom apartments. At the times [2, 4, 6, 8], constraints are set on the final sales of one-bedroom units at 550 and two-bedroom units at 600, as well as on aggregate cumulative revenue with values [0, 80000, 90000, 0, 100000].","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"When demand changes, the algorithm lowers prices for the one‑bedroom group to maintain sales volume, satisfying all financial constraints with minimal losses.","kind":"theoretical","quote":"However, by lowering prices for one-bedroom apartments, the algorithm managed to support sales volume with minimal losses and meet all constraints. Figure 14 shows the aggregate cumulative revenue curve.","support":"full"},{"finding":"Theoretical analysis shows that optimal pricing policies are piecewise constant and only adjust at times when constraints become binding.","kind":"theoretical","quote":"Therefore, by Theorem 1, with constraints on intermediate sales, the price must be constant over the interval, so for t ∈[τj−1, τj], the pricing policy (p1(t), . . . , pk(t)) will contain of constant prices.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":7,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:54:10Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}