<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">tel</journal-id>
      <journal-title-group>
        <journal-title>Theoretical Economics Letters</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2162-2086</issn>
      <issn pub-type="ppub">2162-2078</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/tel.2026.165054</article-id>
      <article-id pub-id-type="publisher-id">tel-154499</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Business</subject>
          <subject>Economics</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>A Supply-Side Pricing Model for Personal Data: Privacy Compensation, Sensitivity, and Information Entropy</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Chen</surname>
            <given-names>Juguang</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Guangzhou Foreign Language School, Guangzhou, China </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The author declares no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>10</month>
        <year>2026</year>
      </pub-date>
      <volume>16</volume>
      <issue>05</issue>
      <fpage>978</fpage>
      <lpage>998</lpage>
      <history>
        <date date-type="received">
          <day>28</day>
          <month>06</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>12</day>
          <month>10</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>15</day>
          <month>10</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/tel.2026.165054">https://doi.org/10.4236/tel.2026.165054</self-uri>
      <abstract>
        <p>Personal-data markets face a pricing problem because data buyers value information content while data providers bear heterogeneous privacy costs. This paper develops a supply-side reference-pricing framework that combines entropy-based information content, information-category sensitivity weights, and stylized privacy-compensation regimes. A Wenjuanxing survey conducted in Guangdong Province, primarily Guangzhou, from March to May 2024 retained 103 of 130 submissions after documented quality screening. The six-item privacy-compensation preference measure showed acceptable internal consistency (Cronbach’s alpha = 0.81; <italic>M</italic> = 3.81, SD = 0.52). Exploratory comparisons indicate differences by age, <italic>F</italic>(5,97) = 3.884, <italic>p</italic> = 0.003, and prior privacy-breach experience, <italic>F</italic>(2,100) = 5.159, <italic>p</italic>= 0.007, whereas gender and education are not significant at the 5% level. All respondents rated the full 16-profile orthogonal conjoint set, yielding normalized sensitivity coefficients highest for biometric information (0.190). The entropy component is calculated from a verified 12-profile, 39-attribute matrix (468 binary attribute opportunities) using observed category frequencies. After correcting the compensation schedules so that <italic>L</italic> = 7 is used consistently and every benchmark factor follows Equation (4), a 1500-yuan baseline produces reference prices from approximately 1331 to 3155 yuan. The output is a transparent supply-side negotiation benchmark rather than a market-clearing price.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Personal Data Markets</kwd>
        <kwd>Privacy Compensation</kwd>
        <kwd>Willingness to Accept</kwd>
        <kwd>Information Entropy</kwd>
        <kwd>Data Pricing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>Personal data have become an economically valuable input in digital markets, but their exchange differs from conventional commodity trade. A single data record can be copied at low marginal cost, combined with other records, and used repeatedly, while disclosure may impose privacy costs on the individual who supplies the information. The resulting valuation problem is therefore two-sided: buyers care about the informational contribution of data, whereas providers care about the expected loss of privacy, control, and future exposure. A workable pricing rule must distinguish these two components rather than treating the value of personal data as a single intrinsic number.</p>
      <p>The economics of privacy provides a natural foundation for this problem. Privacy choices involve trade-offs under imperfect information, and the value individuals attach to protecting or disclosing personal information is heterogeneous across people and contexts ([<xref ref-type="bibr" rid="B2">2</xref>]). Recent work on data markets further shows that personal data may generate informational externalities: one person’s disclosure can reveal information about others, which can alter incentives and depress data prices ([<xref ref-type="bibr" rid="B1">1</xref>]; [<xref ref-type="bibr" rid="B6">6</xref>]). Data markets may therefore exist even when consumers are privacy conscious, but the terms of exchange depend on incentives, data linkages, and the way privacy costs are represented ([<xref ref-type="bibr" rid="B3">3</xref>]).</p>
      <p>Existing data-pricing research has made important progress on query-based prices, arbitrage-free mechanisms, data quality, and information-content measures ([<xref ref-type="bibr" rid="B4">4</xref>]; [<xref ref-type="bibr" rid="B10">10</xref>]; [<xref ref-type="bibr" rid="B11">11</xref>]; [<xref ref-type="bibr" rid="B14">14</xref>]; [<xref ref-type="bibr" rid="B16">16</xref>]). Yet these approaches often price data from the seller or platform perspective and do not directly incorporate heterogeneous reservation compensation on the supply side. At the same time, empirical privacy-valuation research shows that willingness to accept (WTA) compensation varies by information type and disclosure context; for example, consumers may value personally identifiable and medical information differently from less sensitive information ([<xref ref-type="bibr" rid="B12">12</xref>]). This creates a practical gap between technical measures of data content and economic measures of privacy loss. A recent privacy-compensation pricing study likewise emphasizes linking provider privacy costs to data-value components ([<xref ref-type="bibr" rid="B8">8</xref>]).</p>
      <p>This paper addresses that gap by developing a supply-side reference-pricing model for personal data. The model integrates three elements. First, Shannon information entropy captures the informational content of a record. Second, conjoint-derived sensitivity coefficients distinguish the relative privacy weight of seven information categories. Third, stylized compensation functions represent different degrees of tolerance for privacy disclosure. These elements are combined into a transparent record-level pricing factor and then scaled by a baseline monetary value.</p>
      <p>The empirical component is deliberately modest. A survey of 103 respondents is used to describe heterogeneity in privacy-compensation preferences and to calibrate information-category sensitivity. The survey is not treated as a nationally representative estimate of population privacy preferences, and the three compensation functions are not claimed to be latent classes recovered from the sample. Instead, the functions are stylized economic regimes that translate differing levels of privacy tolerance into alternative compensation schedules. This distinction is important because it separates what the data directly support from what is imposed as a modeling device.</p>
      <p>The paper makes three contributions. First, it reframes personal-data pricing as a supply-side reservation-compensation problem rather than as a purely technical valuation exercise. Second, it connects an economic measure of privacy compensation with an information-theoretic measure of data content while preserving the distinction between the two. Third, it provides a numerical illustration showing how the same baseline price can generate different reference prices across data profiles when sensitivity, information content, and compensation regime vary. The proposed output should be interpreted as a pricing benchmark for negotiation or platform design, not as an equilibrium market price.</p>
    </sec>
    <sec id="sec2">
      <title>2. Literature and Economic Framework</title>
      <sec id="sec2dot1">
        <title>2.1. Data Pricing and the Economics of Privacy</title>
        <p>Data pricing has been studied from several complementary directions. Query-based mechanisms price access to database views while avoiding arbitrage ([<xref ref-type="bibr" rid="B10">10</xref>]; [<xref ref-type="bibr" rid="B11">11</xref>]). Other models incorporate data quality, completeness, timeliness, or tuple-level characteristics into the valuation rule ([<xref ref-type="bibr" rid="B14">14</xref>]; [<xref ref-type="bibr" rid="B16">16</xref>]). Asset-valuation approaches extend conventional valuation concepts to data, while information-theoretic approaches use entropy or related measures to describe scarcity, uncertainty, or information content ([<xref ref-type="bibr" rid="B17">17</xref>]). These contributions clarify the technical side of data value but do not fully determine how much a specific individual must be compensated to supply privacy-sensitive data.</p>
        <p>From an economic perspective, the provider’s reservation value is central. WTA is the minimum compensation that makes disclosure acceptable to the provider. In privacy settings, WTA need not equal a socially efficient price because individuals may face limited information about future data use, data may create externalities, and preferences may be context dependent ([<xref ref-type="bibr" rid="B2">2</xref>]; [<xref ref-type="bibr" rid="B1">1</xref>]). Nevertheless, WTA remains a useful supply-side concept because it makes explicit that privacy loss is a cost borne by the provider rather than a free input to the data buyer.</p>
        <p>The present model therefore does not attempt to solve the full equilibrium of a data market. It constructs a reference price from the provider side. Buyer willingness to pay, platform bargaining power, downstream externalities, and competition would still be required to obtain a market-clearing transaction price. This narrower interpretation improves the economic meaning of the model: the output is a structured reservation-compensation benchmark conditioned on the informational contribution of the supplied data.</p>
      </sec>
      <sec id="sec2dot2">
        <title>2.2. Information Entropy and the Model’s Information-Content Term</title>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote a category or state and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> its empirical probability. Shannon self-information for a realized state is <inline-formula><mml:math display="inline"><mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , while Shannon entropy is the probability-weighted expectation over possible states. The classic entropy form is:</p>
        <disp-formula id="FD1">
          <label>(1)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>H</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:msub>
                  <mml:mo>∑</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:msub>
                <mml:mrow>
                  <mml:mi>P</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:msub>
                    <mml:mrow>
                      <mml:mi>log</mml:mi>
                    </mml:mrow>
                    <mml:mn>2</mml:mn>
                  </mml:msub>
                  <mml:mi>P</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Equation (1) provides the information-theoretic foundation, but the record-level quantity <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> used later is deliberately narrower. Because the pricing exercise assigns value only to attributes that are present and disclosed in a profile, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> aggregates the present-state Shannon contribution <inline-formula><mml:math display="inline"><mml:mrow><mml:mo> − </mml:mo><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , weighted by category sensitivity and attribute count. It is therefore a sensitivity-weighted information-content term derived from Shannon entropy, not the full Shannon entropy of the complete binary vector. For a binary variable, the full entropy would additionally include the absent-state term <inline-formula><mml:math display="inline"><mml:mrow><mml:mo> − </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> P </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> P </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . This distinction is maintained throughout the revised model.</p>
      </sec>
      <sec id="sec2dot3">
        <title>2.3. Privacy Sensitivity and WTA</title>
        <p>Personal information is heterogeneous. Identification data, financial records, medical information, location traces, preferences, communication-network information, and biometrics differ in both perceived sensitivity and economic consequences. The Information Security Technology—Personal Information Security Specification (GB/T 35273-2020) ([<xref ref-type="bibr" rid="B15">15</xref>]) provides a practical classification framework, and prior empirical work similarly distinguishes information categories when studying disclosure and privacy concern ([<xref ref-type="bibr" rid="B5">5</xref>]; [<xref ref-type="bibr" rid="B7">7</xref>]; [<xref ref-type="bibr" rid="B12">12</xref>]).</p>
        <p><bold>Table 1.</bold> Survey components and their role in the pricing framework. </p>
        <table-wrap id="tbl1">
          <label>Table 1</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Component</bold>
                </td>
                <td>
                  <bold>Content</bold>
                </td>
                <td>
                  <bold>Role in analysis</bold>
                </td>
              </tr>
              <tr>
                <td>Demographics</td>
                <td>Gender, age, education, occupation, privacy-breach experience</td>
                <td>Describes sample and exploratory heterogeneity</td>
              </tr>
              <tr>
                <td>Privacy-compensation preference</td>
                <td>Three compensation-attitude items and three disclosure-willingness items on 5-point scales</td>
                <td>Exploratory group comparisons; not used as a population risk-preference scale</td>
              </tr>
              <tr>
                <td>Conjoint profiles</td>
                <td>Compensation amount plus seven personal-information categories</td>
                <td>Derives relative utilities and normalized sensitivity coefficients</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note: Privacy-compensation preference is distinguished from domain-general risk attitude to avoid overinterpreting the six survey items.</p>
        <p>The survey used in this study combines attitudinal items concerning compensation and disclosure with a conjoint exercise. The attitudinal items are treated as indicators of privacy-compensation preference, not as a validated measure of general risk preference in the behavioral-economics sense. This terminology avoids equating willingness to disclose personal data with domain-general risk aversion. The conjoint component is used to derive normalized sensitivity weights for the seven information categories. These survey components and their analytical roles are summarized in <bold>Table 1</bold>.</p>
      </sec>
      <sec id="sec2dot4">
        <title>2.4. Stylized Privacy-Compensation Regimes</title>
        <p>To represent heterogeneous provider tolerance for privacy disclosure, the model uses three stylized compensation regimes. They are not estimated latent classes. Rather, they provide comparative pricing schedules for a relatively risk-tolerant provider, a benchmark provider, and a privacy-sensitive provider. Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> denote the aggregate sensitivity of all information supplied by provider <inline-formula><mml:math display="inline"><mml:mi> i </mml:mi></mml:math></inline-formula> , and let <italic>L</italic> denote the number of personal-information categories. In all calculations below, <italic>L</italic> = 7. The three compensation factors are:</p>
        <disp-formula id="FD2">
          <label>(2)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mn>1</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mn>1</mml:mn>
              <mml:mo>−</mml:mo>
              <mml:mfrac>
                <mml:mn>1</mml:mn>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>+</mml:mo>
                  <mml:mn>2</mml:mn>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD3">
          <label>(3)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mn>3</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mi>ln</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msup>
                        <mml:mrow>
                          <mml:mn>10</mml:mn>
                        </mml:mrow>
                        <mml:mn>3</mml:mn>
                      </mml:msup>
                      <mml:mo>×</mml:mo>
                      <mml:msub>
                        <mml:mi>S</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo>+</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mi>L</mml:mi>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD4">
          <label>(4)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mn>2</mml:mn>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mfrac>
                <mml:mrow>
                  <mml:mn>1</mml:mn>
                  <mml:mo>−</mml:mo>
                  <mml:mfrac>
                    <mml:mn>1</mml:mn>
                    <mml:mrow>
                      <mml:mn>1</mml:mn>
                      <mml:mo>+</mml:mo>
                      <mml:mn>2</mml:mn>
                      <mml:msub>
                        <mml:mi>S</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mfrac>
                  <mml:mo>+</mml:mo>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:mi>ln</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msup>
                            <mml:mrow>
                              <mml:mn>10</mml:mn>
                            </mml:mrow>
                            <mml:mn>3</mml:mn>
                          </mml:msup>
                          <mml:mo>×</mml:mo>
                          <mml:msub>
                            <mml:mi>S</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mo>+</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mi>L</mml:mi>
                  </mml:mfrac>
                </mml:mrow>
                <mml:mn>2</mml:mn>
              </mml:mfrac>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <fig id="fig1">
          <label>Figure 1</label>
          <graphic xlink:href="https://html.scirp.org/file/1503442-rId36.jpeg?20261015101900" />
        </fig>
        <p>Note. <italic>C</italic>1 represents the relatively risk-tolerant schedule, <italic>C</italic><sub>2</sub> the benchmark schedule, and <italic>C</italic><sub>3</sub> the privacy-sensitive schedule. The plotted functions use <italic>L</italic>= 7; at <italic>S</italic><italic><sub>i</sub></italic> = 10 they yield <italic>C</italic><sub>1</sub> = 0.952, <italic>C</italic><sub>2</sub> = 1.134, and <italic>C</italic><sub>3</sub> = 1.316.</p>
        <p><bold>Figure 1.</bold>Stylized privacy-compensation schedules.</p>
        <p>The benchmark compensation factor is the average of the relatively risk-tolerant and privacy-sensitive schedules. Aggregate sensitivity is calculated from the quantity of contributed information and the category-specific sensitivity coefficients:</p>
        <disp-formula id="FD5">
          <label>(5)</label>
          <mml:math>
            <mml:mrow>
              <mml:msub>
                <mml:mi>S</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>j</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mtext>m</mml:mtext>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>T</mml:mi>
                    <mml:mrow>
                      <mml:mi>i</mml:mi>
                      <mml:mi>j</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mstyle>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>These functions are dimensionless and monotone in aggregate sensitivity. Specifically, <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> C </mml:mi><mml:mn> 1 </mml:mn></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mn> 2 </mml:mn><mml:mo> / </mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> + </mml:mo><mml:mn> 2 </mml:mn><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mn> 2 </mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> C </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mn> 1000 </mml:mn></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:mn> 7 </mml:mn><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1000 </mml:mn><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> + </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> ; because <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mn> 2 </mml:mn></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> C </mml:mi><mml:mn> 1 </mml:mn></mml:msub><mml:mo> + </mml:mo><mml:msub><mml:mi> C </mml:mi><mml:mn> 3 </mml:mn></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> / </mml:mo><mml:mn> 2 </mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mrow><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> C </mml:mi><mml:mn> 2 </mml:mn></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mtext> d </mml:mtext><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo> &gt; </mml:mo><mml:mn> 0 </mml:mn></mml:mrow></mml:math></inline-formula> as well. The benchmark schedule is therefore exactly the midpoint between the two limiting schedules for every <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . For example, at <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mn> 10 </mml:mn></mml:mrow></mml:math></inline-formula> , <italic>C</italic><sub>1</sub> = 0.952, <italic>C</italic><sub>3</sub> = 1.316, and <italic>C</italic><sub>2</sub> = 1.134. The numerical illustration below calculates every benchmark factor from Equation (4), rather than assigning benchmark values independently (<xref ref-type="fig" rid="fig1">Figure 1</xref>).</p>
      </sec>
    </sec>
    <sec id="sec3">
      <title>3. Research Design</title>
      <sec id="sec3dot1">
        <title>3.1. Survey Procedure, Documentation, and Sample</title>
        <p>The study used an online questionnaire administered through Wenjuanxing between March and May 2024. Participants were recruited by convenience sampling through WeChat and personal networks and through school and workplace channels, with limited onward sharing of the questionnaire link. Recruitment was geographically concentrated in Guangdong Province, primarily Guangzhou. Eligibility required respondents to be able to read Chinese, use Internet or mobile services, and complete the online questionnaire; the study did not impose an age-18 eligibility threshold. A total of 130 submissions were recorded. Data-quality screening excluded 27 cases: 12 were incomplete or missing key questionnaire/conjoint sections, 7 had completion times below one-third of the sample median, 5 showed clear straight-line responding or logical inconsistencies, and 3 were duplicate submissions identified from the platform record and response pattern. The final analytical sample therefore contained 103 respondents, a retained-response rate of 79.2%. Because recruitment was non-probability based, the sample is treated as a calibration sample rather than a population-representative survey.</p>
        <p>Privacy-compensation preference was measured with six 5-point items (1 = strongly disagree, 5 = strongly agree). The three compensation-attitude items were: C1, “I should receive compensation when an organization collects or uses my personal information”; C2, “The more sensitive the personal information is, the higher the compensation should be”; and C3, “I would require higher compensation when more categories of my personal information are disclosed.” The three disclosure-willingness items were: D1, “I am willing to provide basic identity information when the compensation is adequate”; D2, “I am willing to provide location or behavioral information when the compensation is adequate”; and D3, “I am willing to provide highly sensitive information (e.g., financial, health, or biometric data) when the compensation is adequate.” C1-C3 were scored in the original direction and D1-D3 were reverse-coded so that higher values consistently indicated a stronger compensation requirement. The composite score was the mean of the six items after reverse coding. Internal consistency was Cronbach’s alpha = 0.81; the composite had <italic>M</italic> = 3.81 and SD = 0.52 in the 103 retained cases. The measure is interpreted specifically as privacy-compensation preference rather than as a domain-general risk-aversion scale.</p>
        <p>Within the retained sample, men account for 52.43% and women 47.57%. The age distribution is concentrated in the 36 - 55 range: respondents aged 46 - 55 constitute 46.60% and those aged 36 - 45 constitute 30.10%. Bachelor’s degree holders are the largest education group at 33.98%, followed by associate-degree/junior-college respondents at 25.24%. Corporate employees account for 35.92% of the sample. Ninety-three respondents (90.29%) report that they regard privacy as very important. All sample counts and analytical inputs reported below were cross-checked against the archived questionnaire export, screening log, conjoint record, and calculation files before the revised model was recomputed. Detailed sample characteristics are reported in <bold>Table 2</bold>.</p>
        <p><bold>Table 2.</bold>Sample characteristics (N = 103). </p>
        <table-wrap id="tbl2">
          <label>Table 2</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Characteristic</bold>
                </td>
                <td>
                  <bold>Category</bold>
                </td>
                <td>
                  <bold>n</bold>
                </td>
                <td>
                  <bold>%</bold>
                </td>
              </tr>
              <tr>
                <td>Gender</td>
                <td>Male</td>
                <td>54</td>
                <td>52.43</td>
              </tr>
              <tr>
                <td>Gender</td>
                <td>Female</td>
                <td>49</td>
                <td>47.57</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>Below 18</td>
                <td>7</td>
                <td>6.80</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>18 - 25</td>
                <td>3</td>
                <td>2.91</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>26 - 35</td>
                <td>7</td>
                <td>6.80</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>36 - 45</td>
                <td>31</td>
                <td>30.10</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>46 - 55</td>
                <td>48</td>
                <td>46.60</td>
              </tr>
              <tr>
                <td>Age</td>
                <td>56 or above</td>
                <td>7</td>
                <td>6.80</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>High school or below</td>
                <td>19</td>
                <td>18.45</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>Associate/junior college</td>
                <td>26</td>
                <td>25.24</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>Bachelor’s degree</td>
                <td>35</td>
                <td>33.98</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>Master’s degree</td>
                <td>18</td>
                <td>17.48</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>Doctoral degree or higher</td>
                <td>5</td>
                <td>4.85</td>
              </tr>
              <tr>
                <td>Occupation</td>
                <td>Corporate employee</td>
                <td>37</td>
                <td>35.92</td>
              </tr>
              <tr>
                <td>Occupation</td>
                <td>Freelancer</td>
                <td>23</td>
                <td>22.33</td>
              </tr>
              <tr>
                <td>Occupation</td>
                <td>Civil servant/public institution</td>
                <td>12</td>
                <td>11.65</td>
              </tr>
              <tr>
                <td>Occupation</td>
                <td>Student</td>
                <td>8</td>
                <td>7.77</td>
              </tr>
              <tr>
                <td>Occupation</td>
                <td>Other</td>
                <td>23</td>
                <td>22.33</td>
              </tr>
              <tr>
                <td>Privacy importance</td>
                <td>Very important</td>
                <td>93</td>
                <td>90.29</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec3dot2">
        <title>3.2. Personal-Information Categories</title>
        <p>Drawing on prior classifications and GB/T 35273-2020, the study organizes personal information into seven categories. The categories are broad enough to support a parsimonious pricing rule while retaining economically meaningful differences in privacy sensitivity. The seven personal-information categories and their illustrative content are presented in <bold>Table 3</bold>.</p>
        <p><bold>Table 3.</bold>Personal-information categories. </p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Category</bold>
                </td>
                <td>
                  <bold>Illustrative content</bold>
                </td>
              </tr>
              <tr>
                <td>Basic identity</td>
                <td>ID number, name, age, gender, marital status, occupation, education, residential information</td>
              </tr>
              <tr>
                <td>Communication network</td>
                <td>Phone number, email, account identifiers, network-use records, IP address, communication records</td>
              </tr>
              <tr>
                <td>Financial</td>
                <td>Credit information, income, consumption records, bank-account details, assets</td>
              </tr>
              <tr>
                <td>Preference</td>
                <td>Interests, traits, preferences, habits, religious beliefs, political leanings</td>
              </tr>
              <tr>
                <td>Location</td>
                <td>Movement trajectories and precise positioning</td>
              </tr>
              <tr>
                <td>Medical and health</td>
                <td>Medical visits, medical history, health status</td>
              </tr>
              <tr>
                <td>Biometric</td>
                <td>Genes, fingerprints, voice, palm prints, iris and facial-recognition features</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note: Classification is based on the study’s original coding scheme and GB/T 35273-2020 ([<xref ref-type="bibr" rid="B15">15</xref>]).</p>
      </sec>
      <sec id="sec3dot3">
        <title>3.3. Conjoint Design and Sensitivity Calibration</title>
        <p>The conjoint task treated each hypothetical data-sharing profile as a bundle of attributes. The compensation attribute had three levels-300, 1500, and 3000 yuan-and each of the seven personal-information categories was coded as present or absent. An orthogonal design reduced the full factorial space to 16 profiles. Every respondent evaluated all 16 profiles on a 5-point acceptance/disclosure-willingness rating scale (1 = very unwilling, 5 = very willing). The orthogonal profile set was fixed, while Wenjuanxing randomized the order in which profiles were presented to respondents to reduce systematic order effects.</p>
        <p>The monetary amounts are experimental levels rather than externally validated transaction prices. Following standard additive conjoint practice ([<xref ref-type="bibr" rid="B9">9</xref>]; [<xref ref-type="bibr" rid="B13">13</xref>]), an additive conjoint model was estimated across the 16 ratings. For information category <italic>j</italic>, its utility range was calculated as <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mi> max </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mrow><mml:mi> j </mml:mi><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:mi> min </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> u </mml:mi><mml:mrow><mml:mi> j </mml:mi><mml:mi> l </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> across the present/absent levels; category sensitivity was then normalized as <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> / </mml:mo><mml:mrow><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo> ∑ </mml:mo><mml:mrow><mml:mi> k </mml:mi><mml:mo> = </mml:mo><mml:mn> 1 </mml:mn></mml:mrow><mml:mn> 7 </mml:mn></mml:msubsup><mml:mrow><mml:msub><mml:mi> r </mml:mi><mml:mi> k </mml:mi></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> , so that the seven information-category coefficients sum to one. The compensation attribute was estimated jointly in the conjoint model but was not included in this seven-category normalization. Model fit was Pearson’s R = 0.847 and Kendall’s tau = 0.712, indicating reasonably strong agreement between predicted and observed profile ordering within the sample. The conjoint attributes and levels are summarized in <bold>Table 4</bold>.</p>
        <p><bold>Table 4.</bold>Conjoint attributes and levels. </p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Attribute</bold>
                </td>
                <td>
                  <bold>Levels</bold>
                </td>
              </tr>
              <tr>
                <td>Compensation amount</td>
                <td>300/1500/3000 yuan</td>
              </tr>
              <tr>
                <td>Basic identity information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Communication-network information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Financial information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Preference information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Location information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Medical and health information</td>
                <td>Present/absent</td>
              </tr>
              <tr>
                <td>Biometric information</td>
                <td>Present/absent</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec3dot4">
        <title>3.4. Analytical Strategy</title>
        <p>The empirical analysis has two linked purposes. First, the six-item privacy-compensation preference score is used in exploratory subgroup comparisons. Gender is tested with an independent-samples t test; age, education, and prior privacy-breach experience are examined with one-way ANOVA. Effect sizes are reported as Cohen’s d for gender and eta-squared for the ANOVAs. These subgroup tests describe heterogeneity but do not define the three stylized compensation regimes and are not inputs to Equations (2)-(8). Second, conjoint utility ranges are normalized across the seven information categories to obtain <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , after which the pricing model combines those category weights with profile-specific information quantities, empirically reconstructed entropy probabilities, and one of the three compensation schedules.</p>
        <p>Before group comparisons, score distributions and residual plots were inspected and homogeneity of variance was checked with Levene tests; no material variance violation was detected (all <italic>p</italic> &gt; 0.05). The six pre-specified age categories were retained rather than pooled post hoc, even though the 18 - 25 group contained only three respondents and three additional age cells contained seven respondents. Consequently, the age result is treated as exploratory and no pairwise claim is made from the sparse cells. The doctoral education group (<italic>n</italic> = 5) is handled similarly. The verified statistics are <italic>t</italic>(101) = −0.676, <italic>p</italic> = 0.501 for gender; <italic>F</italic>(5,97) = 3.884, <italic>p</italic>= 0.003 for age; <italic>F</italic>(4,98) = 2.396, <italic>p</italic> = 0.055 for education; and <italic>F</italic>(2,100) = 5.159, <italic>p</italic> = 0.007 for prior privacy-breach experience.</p>
      </sec>
    </sec>
    <sec id="sec4">
      <title>4. Empirical Results</title>
      <sec id="sec4dot1">
        <title>4.1. Exploratory Heterogeneity in Privacy-Compensation Preference</title>
        <p>The verified subgroup comparisons are summarized in <bold>Table 5</bold>. Men (<italic>n</italic> = 54, <italic>M</italic> = 3.77, SD = 0.525) and women (<italic>n</italic> = 49, <italic>M</italic> = 3.84, SD = 0.525) differ only trivially, <italic>t</italic>(101) = −0.676, <italic>p</italic> = 0.501, <italic>d</italic> = −0.133. Across the six age groups, means increase from 3.35 (&lt;18), 3.30 (18 - 25), 3.55 (26 - 35), and 3.72 (36 - 45) to 3.95 (46 - 55) and 4.10 (56+), with a common within-group SD of approximately 0.482; the omnibus difference is <italic>F</italic>(5,97) = 3.884, <italic>p</italic> = 0.003, eta-squared = 0.167. Education means are 3.60, 3.72, 3.86, 4.00, and 4.15 from the lowest to highest category (SD approximately 0.496), but the omnibus result does not reach the 5% threshold, <italic>F</italic>(4,98) = 2.396, <italic>p</italic> = 0.055, eta-squared = 0.089. Prior privacy-breach experience shows a significant difference: no breach (<italic>n</italic> = 58, <italic>M</italic> = 3.68), unsure/suspected (<italic>n</italic> = 18, <italic>M</italic> = 3.84), and yes (<italic>n</italic> = 27, <italic>M</italic> = 4.05), with SD approximately 0.497, <italic>F</italic>(2,100) = 5.159, <italic>p</italic>= 0.007, eta-squared = 0.094. These patterns support heterogeneity in privacy-compensation preference but do not justify mechanically assigning demographic groups to the model’s stylized compensation regimes.</p>
        <p><bold>Table 5.</bold>Exploratory group comparisons in privacy-compensation preference.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Variable</bold>
                </td>
                <td>
                  <bold>Group sizes</bold>
                </td>
                <td>
                  <bold>Test (df),</bold>
                  <italic>
                    <bold>p</bold>
                  </italic>
                </td>
                <td>
                  <bold>Effect size</bold>
                </td>
                <td>
                  <bold>Assumption/handling</bold>
                </td>
              </tr>
              <tr>
                <td>Gender</td>
                <td>Male 54; Female 49</td>
                <td>
                  <italic>t</italic>
                  (101) = −0.676;
                  <italic>p</italic>
                  = 0.501
                </td>
                <td>d = −0.133</td>
                <td>
                  Levene
                  <italic>p</italic>
                  &gt; 0.05; assumptions acceptable
                </td>
              </tr>
              <tr>
                <td>Age</td>
                <td>7/3/7/31/48/7</td>
                <td>
                  <italic>F</italic>
                  (5,97) = 3.884;
                  <italic>p</italic>
                  = 0.003
                </td>
                <td>eta^2 = 0.167</td>
                <td>All six groups retained; sparse cells; omnibus exploratory; no pairwise claims</td>
              </tr>
              <tr>
                <td>Education</td>
                <td>19/26/35/18/5</td>
                <td>
                  <italic>F</italic>
                  (4,98) = 2.396;
                  <italic>p</italic>
                  = 0.055
                </td>
                <td>eta^2 = 0.089</td>
                <td>
                  Levene
                  <italic>p</italic>
                  &gt; 0.05; doctoral n = 5; no pairwise claims
                </td>
              </tr>
              <tr>
                <td>Prior privacy breach</td>
                <td>No 58; Unsure 18; Yes 27</td>
                <td>
                  <italic>F</italic>
                  (2,100) = 5.159;
                  <italic>p</italic>
                  = 0.007
                </td>
                <td>eta^2 = 0.094</td>
                <td>
                  Levene
                  <italic>p</italic>
                  &gt; 0.05; assumptions acceptable
                </td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note. All group counts, test statistics, and effect sizes were verified against the archived analysis. The six age categories and five education categories were retained as pre-specified groups; because some cells are small, no pairwise inference is based on the sparse groups.</p>
      </sec>
      <sec id="sec4dot2">
        <title>4.2. Information-Sensitivity Coefficients</title>
        <p>The normalized information-category sensitivity coefficients derived from the conjoint utility ranges sum to one. Biometric information receives the largest weight (0.190), followed by financial information (0.141), medical and health information (0.140), basic identity information (0.140), preference information (0.136), location information (0.127), and communication-network information (0.126). These coefficients are sample-specific relative sensitivity weights: they indicate how strongly information categories differentiate disclosure utility within this conjoint calibration, not universal monetary values or legal damage weights. The resulting coefficients are reported in <bold>Table 6</bold>.</p>
        <p><bold>Table 6.</bold>Normalized personal-information sensitivity coefficients. </p>
        <table-wrap id="tbl6">
          <label>Table 6</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Information category</bold>
                </td>
                <td>
                  <bold>Sensitivity coefficient (</bold>
                  <italic>
                    <bold>s</bold>
                  </italic>
                  <italic>
                    <bold>
                      <sub>j</sub>
                    </bold>
                  </italic>
                  <bold>)</bold>
                </td>
              </tr>
              <tr>
                <td>Basic identity information</td>
                <td>0.140</td>
              </tr>
              <tr>
                <td>Communication-network information</td>
                <td>0.126</td>
              </tr>
              <tr>
                <td>Financial information</td>
                <td>0.141</td>
              </tr>
              <tr>
                <td>Preference information</td>
                <td>0.136</td>
              </tr>
              <tr>
                <td>Location information</td>
                <td>0.127</td>
              </tr>
              <tr>
                <td>Medical and health information</td>
                <td>0.140</td>
              </tr>
              <tr>
                <td>Biometric information</td>
                <td>0.190</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note. Coefficients are normalized to sum to 1.000.</p>
      </sec>
    </sec>
    <sec id="sec5">
      <title>5. Integrated Pricing Model and Numerical Illustration</title>
      <sec id="sec5dot1">
        <title>5.1. Record-Level Pricing Factor</title>
        <p>Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> denote the number of present attributes from category <italic>j</italic> in profile <italic>i</italic>, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the normalized sensitivity coefficient for category<italic>j</italic>, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:mo> = </mml:mo><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the category-specific sensitivity contribution. Let <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denote the empirical presence probability for category <italic>j</italic> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> the compensation factor associated with the selected privacy-compensation regime. The model-specific sensitivity-weighted information-content term is <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mo> − </mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∑ </mml:mo><mml:mi> j </mml:mi></mml:msub><mml:mrow><mml:mrow><mml:mo> [ </mml:mo><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow><mml:mo> ] </mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> , and the record-level pricing factor is <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> F </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> . <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is derived from the present-state Shannon entropy contribution; it is not the full binary Shannon entropy because absent states are intentionally excluded from the pricing index.</p>
        <disp-formula id="FD6">
          <label>(6)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>F</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>X</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mi>C</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>j</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mi>m</mml:mi>
                    </mml:munderover>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>S</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>×</mml:mo>
                      <mml:msub>
                        <mml:mrow>
                          <mml:mi>log</mml:mi>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>The record-level monetary reference price scales this factor by a baseline value<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> :</p>
        <disp-formula id="FD7">
          <label>(7)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>V</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>V</mml:mi>
                <mml:mn>0</mml:mn>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>×</mml:mo>
              <mml:mi>C</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>x</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>×</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:msubsup>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>j</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mi>m</mml:mi>
                    </mml:msubsup>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>S</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>×</mml:mo>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>×</mml:mo>
                      <mml:msub>
                        <mml:mrow>
                          <mml:mi>log</mml:mi>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Aggregating across n providers yields the dataset-level supply-side reference value:</p>
        <disp-formula id="FD8">
          <label>(8)</label>
          <mml:math>
            <mml:mrow>
              <mml:mi>V</mml:mi>
              <mml:mo>=</mml:mo>
              <mml:mo>−</mml:mo>
              <mml:mstyle displaystyle="true">
                <mml:munderover>
                  <mml:mo>∑</mml:mo>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>=</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mi>m</mml:mi>
                </mml:munderover>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>V</mml:mi>
                    <mml:mn>0</mml:mn>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mi>C</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>x</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mstyle>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mstyle displaystyle="true">
                    <mml:munderover>
                      <mml:mo>∑</mml:mo>
                      <mml:mrow>
                        <mml:mi>j</mml:mi>
                        <mml:mo>=</mml:mo>
                        <mml:mn>1</mml:mn>
                      </mml:mrow>
                      <mml:mi>m</mml:mi>
                    </mml:munderover>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>S</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>×</mml:mo>
                      <mml:msub>
                        <mml:mrow>
                          <mml:mi>log</mml:mi>
                        </mml:mrow>
                        <mml:mn>2</mml:mn>
                      </mml:msub>
                      <mml:mi>P</mml:mi>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>x</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mstyle>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Equations (6)-(8) make the units and economic structure explicit. <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are dimensionless, while the baseline <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> carries the monetary unit; therefore <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> V </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> has the same currency unit as <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> V </mml:mi><mml:mn> 0 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . In the verified numerical matrix below, <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is computed from the observed presence frequency of attributes in the same information category across the 12 profiles. Absent attributes do not enter <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> because the pricing rule values disclosed/present attributes only. Thus <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> should be interpreted as a sensitivity-weighted information-content index, not as the entropy of the full 39-dimensional binary vector. The model is multiplicative: holding other terms fixed, a larger compensation factor, information-content term, or baseline raises the reference price proportionally.</p>
      </sec>
      <sec id="sec5dot2">
        <title>5.2. Comparative Statics and Interpretation</title>
        <p>First, holding the baseline price and information content fixed, a larger compensation factor increases the model-implied reference price proportionally. The three stylized regimes therefore create an explicit privacy-compensation wedge between otherwise identical data profiles. Second, holding the compensation regime fixed, information categories with larger sensitivity coefficients contribute more to the weighted information-content term. Third, because the baseline price enters multiplicatively, changing <italic>V</italic><sub>0</sub> rescales all model-implied prices without changing the ranking of profiles, provided the same baseline is used for all observations.</p>
        <p>These properties also clarify what the model does not measure. The Shannon-derived information-content term is not buyer willingness to pay, the sensitivity coefficient is not a legal damages schedule, and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> C </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is not a statistically estimated coefficient from a structural utility model. The framework is therefore best used as a transparent supply-side pricing rule or negotiation benchmark. A complete market model would additionally require demand-side value, bargaining, data externalities, platform competition, and transaction costs.</p>
      </sec>
      <sec id="sec5dot3">
        <title>5.3. Verified Numerical Illustration and Information-Content Inputs</title>
        <p>The numerical illustration uses a study-generated 12-profile binary attribute matrix rather than an external public dataset. The matrix contains 39 attributes grouped into seven categories: 9 basic-identity attributes, 3 communication-network attributes, 5 financial attributes, 14 preference attributes, 2 location attributes, 4 medical/health attributes, and 2 biometric attributes. The observation unit for the entropy frequencies is an attribute state within a profile. With 12 profiles and 39 attributes, the matrix contains 468 binary attribute opportunities. Across these opportunities, 304 attributes are present.</p>
        <p>Category-specific presence probabilities are calculated directly from the 12-profile matrix: basic identity 87/108 = 0.8056; communication network 22/36 = 0.6111; financial 35/60 = 0.5833; preference 97/168 = 0.5774; location 15/24 = 0.6250; medical/health 28/48 = 0.5833; and biometric 20/24 = 0.8333. For each present attribute in category <italic>j</italic>, <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is set to the corresponding category probability. A common baseline <italic>V</italic><sub>0</sub> = 1500 yuan is used for all 12 profiles. The profile count vector <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is combined with the sensitivity coefficients reported in <bold>Table 6</bold> to obtain <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> ; risk-tolerant profiles use <italic>C</italic><sub>1</sub>, benchmark profiles use <italic>C</italic><sub>2</sub> = (<italic>C</italic><sub>1</sub> + <italic>C</italic><sub>3</sub>)/2, and privacy-sensitive profiles use <italic>C</italic><sub>3</sub>. Supplementary <bold>Tables S1-S4</bold> provide the complete 12 × 39 binary realization, category-frequency inputs, and reproducibility calculations. The profile-level information counts and assigned regimes are summarized in <bold>Table 7</bold>.</p>
        <p><bold>Table 7.</bold>Data profiles in the verified numerical illustration.</p>
        <table-wrap id="tbl7">
          <label>Table 7</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>No.</bold>
                </td>
                <td>
                  <bold>ID</bold>
                </td>
                <td>
                  <bold>Comm.</bold>
                </td>
                <td>
                  <bold>Fin.</bold>
                </td>
                <td>
                  <bold>Pref.</bold>
                </td>
                <td>
                  <bold>Loc.</bold>
                </td>
                <td>
                  <bold>Health</bold>
                </td>
                <td>
                  <bold>Bio.</bold>
                </td>
                <td>
                  <bold>Total</bold>
                </td>
                <td>
                  <bold>Regime</bold>
                </td>
              </tr>
              <tr>
                <td>1</td>
                <td>7</td>
                <td>1</td>
                <td>4</td>
                <td>6</td>
                <td>2</td>
                <td>0</td>
                <td>2</td>
                <td>22</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>2</td>
                <td>8</td>
                <td>2</td>
                <td>0</td>
                <td>9</td>
                <td>1</td>
                <td>0</td>
                <td>2</td>
                <td>22</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>3</td>
                <td>9</td>
                <td>0</td>
                <td>2</td>
                <td>1</td>
                <td>1</td>
                <td>4</td>
                <td>2</td>
                <td>19</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>4</td>
                <td>7</td>
                <td>2</td>
                <td>1</td>
                <td>9</td>
                <td>1</td>
                <td>3</td>
                <td>1</td>
                <td>24</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>5</td>
                <td>7</td>
                <td>3</td>
                <td>5</td>
                <td>12</td>
                <td>0</td>
                <td>3</td>
                <td>2</td>
                <td>32</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>6</td>
                <td>5</td>
                <td>1</td>
                <td>5</td>
                <td>11</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>28</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>7</td>
                <td>9</td>
                <td>2</td>
                <td>4</td>
                <td>14</td>
                <td>1</td>
                <td>2</td>
                <td>1</td>
                <td>33</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>8</td>
                <td>8</td>
                <td>2</td>
                <td>4</td>
                <td>4</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>24</td>
                <td>Risk-tolerant</td>
              </tr>
              <tr>
                <td>9</td>
                <td>8</td>
                <td>3</td>
                <td>2</td>
                <td>8</td>
                <td>1</td>
                <td>4</td>
                <td>1</td>
                <td>27</td>
                <td>Risk-tolerant</td>
              </tr>
              <tr>
                <td>10</td>
                <td>7</td>
                <td>1</td>
                <td>3</td>
                <td>10</td>
                <td>0</td>
                <td>2</td>
                <td>1</td>
                <td>24</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>11</td>
                <td>8</td>
                <td>2</td>
                <td>3</td>
                <td>9</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>28</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>12</td>
                <td>4</td>
                <td>3</td>
                <td>2</td>
                <td>4</td>
                <td>2</td>
                <td>4</td>
                <td>2</td>
                <td>21</td>
                <td>Benchmark</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note. The 12 rows form the study-generated 12 × 39 profile matrix used for the numerical illustration. Regime labels are scenario assignments for applying <italic>C</italic><sub>1</sub>, <italic>C</italic><sub>2</sub>, or <italic>C</italic><sub>3</sub>; they are not demographic classifications.</p>
        <p><bold>Table 8.</bold>Recomputed pricing results from the verified profile matrix (<italic>V</italic><sub>0</sub> = 1500 yuan).</p>
        <table-wrap id="tbl8">
          <label>Table 8</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>No.</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>Regime</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>Information-content</bold>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>H</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>Reference price (yuan)</bold>
                </td>
              </tr>
              <tr>
                <td>1</td>
                <td>3.120</td>
                <td>Benchmark</td>
                <td>1.006</td>
                <td>1.121</td>
                <td>1691.112</td>
              </tr>
              <tr>
                <td>2</td>
                <td>3.103</td>
                <td>Privacy-sensitive</td>
                <td>1.149</td>
                <td>1.088</td>
                <td>1874.536</td>
              </tr>
              <tr>
                <td>3</td>
                <td>2.745</td>
                <td>Benchmark</td>
                <td>0.989</td>
                <td>0.898</td>
                <td>1331.387</td>
              </tr>
              <tr>
                <td>4</td>
                <td>3.334</td>
                <td>Privacy-sensitive</td>
                <td>1.159</td>
                <td>1.266</td>
                <td>2200.077</td>
              </tr>
              <tr>
                <td>5</td>
                <td>4.495</td>
                <td>Privacy-sensitive</td>
                <td>1.202</td>
                <td>1.751</td>
                <td>3155.288</td>
              </tr>
              <tr>
                <td>6</td>
                <td>3.941</td>
                <td>Benchmark</td>
                <td>1.035</td>
                <td>1.553</td>
                <td>2410.939</td>
              </tr>
              <tr>
                <td>7</td>
                <td>4.577</td>
                <td>Benchmark</td>
                <td>1.053</td>
                <td>1.775</td>
                <td>2803.900</td>
              </tr>
              <tr>
                <td>8</td>
                <td>3.394</td>
                <td>Risk-tolerant</td>
                <td>0.872</td>
                <td>1.214</td>
                <td>1586.564</td>
              </tr>
              <tr>
                <td>9</td>
                <td>3.745</td>
                <td>Risk-tolerant</td>
                <td>0.882</td>
                <td>1.421</td>
                <td>1880.111</td>
              </tr>
              <tr>
                <td>10</td>
                <td>3.359</td>
                <td>Benchmark</td>
                <td>1.015</td>
                <td>1.284</td>
                <td>1954.850</td>
              </tr>
              <tr>
                <td>11</td>
                <td>3.933</td>
                <td>Benchmark</td>
                <td>1.035</td>
                <td>1.461</td>
                <td>2267.381</td>
              </tr>
              <tr>
                <td>12</td>
                <td>2.958</td>
                <td>Benchmark</td>
                <td>0.999</td>
                <td>1.127</td>
                <td>1687.555</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>The information-content term and compensation factor are recomputed from the documented inputs, as shown in <bold>Table 8</bold>. The revision also corrects the earlier benchmark inconsistency: for profile 1, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> = 3.120 gives <italic>C</italic><sub>1</sub> = 0.862 and <italic>C</italic><sub>3</sub> = 1.149, so Equation (4) yields <italic>C</italic><sub>2</sub> = 1.006. Using <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> from the verified category frequencies and <italic>V</italic><sub>0</sub> = 1500 yuan, the weighted information-content terms range from 0.898 to 1.775 and the resulting reference prices range from 1331.387 yuan (profile 3) to 3155.288 yuan (profile 5). Calculations use unrounded probabilities and compensation factors; displayed values are rounded for readability.</p>
      </sec>
    </sec>
    <sec id="sec6">
      <title>6. Discussion</title>
      <sec id="sec6dot1">
        <title>6.1. Economic Contribution</title>
        <p>The central contribution of the framework is conceptual separation. Personal-data pricing contains at least three distinct objects that are often conflated: information content, privacy sensitivity, and provider reservation compensation. Shannon entropy supplies the information-theoretic foundation, while the model-specific <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is a sensitivity-weighted present-state information-content term; sensitivity weights capture the relative privacy importance of information categories; and the compensation factor represents the provider-side adjustment required under different privacy-tolerance regimes. Multiplying these components creates a tractable reference-pricing rule without claiming that <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the full entropy of a binary record or that any single component is itself the market price.</p>
        <p>This separation connects the paper to the broader economics of data markets. Prior research emphasizes that data have externalities and that individual disclosure can affect the information available about others ([<xref ref-type="bibr" rid="B1">1</xref>]; [<xref ref-type="bibr" rid="B6">6</xref>]). The present model does not solve those externalities, but it contributes a micro-level pricing primitive that can be embedded in richer market settings: the amount a platform would need to compensate a provider before demand-side value and external effects are considered. In that sense, the model is closer to a reservation-compensation schedule than to a complete theory of data-market equilibrium.</p>
        <p>Behavioral evidence remains secondary to the pricing model but is now fully documented. The six-item measure has acceptable internal consistency, and the corrected age and privacy-breach ANOVAs indicate meaningful heterogeneity in privacy-compensation preference. At the same time, the very small age cells, the non-significant gender result, and the education result at p = 0.055 argue against demographic pricing rules. The three compensation regimes therefore remain transparent modeling scenarios rather than respondent classes inferred from age, education, gender, or breach history.</p>
      </sec>
      <sec id="sec6dot2">
        <title>6.2. Implications for Data-Market Design</title>
        <p>For data platforms, the model provides a transparent way to structure a posted compensation schedule. A platform could begin with a common baseline value, apply category-specific sensitivity weights, and then offer alternative compensation schedules reflecting consent conditions or privacy guarantees. The approach is especially useful when a platform lacks a long history of comparable transactions and therefore cannot estimate market prices directly.</p>
        <p>The framework also illustrates why a single uniform price for all personal data is difficult to justify. Biometric and financial information receive higher sensitivity weights than communication-network and location information in the present calibration, and privacy-sensitive providers receive a larger compensation adjustment than risk-tolerant providers. Even if a platform ultimately uses a simpler commercial rule, these differences identify the dimensions along which a uniform price can undercompensate some providers and overcompensate others.</p>
        <p>Policy applications require greater caution. The sensitivity coefficients in this study are sample-specific and should not be used as statutory compensation standards for data breaches. Legal damages depend on rights, harm, causation, and jurisdiction, whereas the present coefficients reflect relative disclosure sensitivity in a survey exercise. The model is therefore more appropriate for voluntary data exchange and platform pricing than for legal damage assessment.</p>
      </sec>
      <sec id="sec6dot3">
        <title>6.3. Limitations and Future Research</title>
        <p>Several limitations are important. First, the survey is a small non-probability convenience sample recruited primarily in Guangzhou and the wider Guangdong context. Although recruitment procedures and exclusions are now documented, the sample should not be treated as representative of the broader Chinese population. Replication with a larger probability-based sample would improve the stability and generalizability of subgroup and sensitivity estimates.</p>
        <p>Second, the six-item privacy-compensation preference measure is study-specific. Its internal consistency is acceptable (alpha = 0.81), but it is not a validated domain-general risk-preference instrument. Future work should combine privacy-specific WTA items with established behavioral risk measures and test convergent, discriminant, and predictive validity.</p>
        <p>Third, the conjoint task is hypothetical. Every respondent rated all 16 profiles and profile order was randomized, which improves internal consistency of administration, but hypothetical ratings may still differ from incentive-compatible disclosure choices. Future studies should use real or consequential compensation where feasible and test whether sensitivity weights replicate out of sample.</p>
        <p>Fourth, the category probabilities used in the Shannon-derived information-content term are estimated from the study-generated 12 × 39 profile matrix rather than from the empirical distribution of a large external data market. This makes the calculation reproducible but still illustrative. Future research should estimate <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> from a named external dataset and compare model-implied prices with actual negotiated prices, buyer willingness to pay, or experimentally elicited willingness to accept in a holdout sample.</p>
        <p>Fifth, the framework is intentionally supply-side. It does not model informational externalities, bargaining, platform competition, repeated use of data, or the marginal value of data to a specific buyer. These mechanisms are central to welfare and equilibrium pricing in data markets ([<xref ref-type="bibr" rid="B1">1</xref>]; [<xref ref-type="bibr" rid="B6">6</xref>]). A natural extension is to embed the current reservation-compensation rule in a two-sided bargaining or mechanism-design model.</p>
      </sec>
    </sec>
    <sec id="sec7">
      <title>7. Conclusion</title>
      <p>This paper develops a supply-side reference-pricing model for personal data that integrates privacy compensation, information sensitivity, and information entropy. The verified survey data show acceptable reliability for the six-item privacy-compensation preference measure and exploratory heterogeneity by age and prior privacy-breach experience. The conjoint task provides normalized sensitivity weights across seven categories of personal information, with biometric information receiving the largest weight in this sample. These behavioral results inform the calibration but do not mechanically assign individuals to the three stylized compensation regimes.</p>
      <p>The model’s main value lies in its transparent and reproducible structure rather than in a claim of universal pricing accuracy. The revised implementation uses <italic>L</italic> = 7 consistently, calculates every benchmark factor as the arithmetic mean specified by Equation (4), documents the 12 × 39 attribute matrix and the empirical category frequencies used for <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , and recomputes every information-content term and reference price from those inputs. The accompanying Supplementary Material provides the complete binary realization and step-by-step reproducibility tables. The numerical illustration is therefore internally reproducible, while external market validation remains a task for future research. Framed in this way, the model provides a supply-side negotiation benchmark while preserving the distinction among privacy cost, information content, and market value.</p>
    </sec>
    <sec id="sec8">
      <title>Supplementary Material</title>
      <p>Supplementary <bold>Tables S1-S4</bold>report the complete 12 × 39 binary realization, category-level probability inputs, profile counts, and step-by-step pricing calculations used to reproduce the numerical illustration.</p>
    </sec>
    <sec id="sec9">
      <title>Supplementary Material</title>
      <sec id="sec9dot1">
        <title>S1. Purpose and Interpretation of the Binary Matrix</title>
        <p>The numerical illustration is based on 12 profiles and 39 binary attribute indicators grouped into seven information categories. The model enters these data through category-level present counts <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and category-specific probabilities <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . Accordingly, the identity of a particular indicator within a category is exchangeable for the calculation: any within-category permutation leaves <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> S </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , and the resulting reference price unchanged. <bold>Tables S1(a)-(c)</bold> provide the complete canonical 12 × 39 binary realization used for reproducibility, with 1 indicating a present/disclosed attribute and 0 indicating an absent attribute. The matrix exactly reproduces the verified category counts reported in the manuscript.</p>
        <p><bold>Table S1.</bold>(a) Binary matrix: basic identity and communication network; (b) Binary matrix: financial and preference indicators 1 - 7; (c) Binary matrix: preference indicators 8 - 14, location, medical/health, and biometric. </p>
        <table-wrap id="tbl9">
          <label>Table 9</label>
          <table>
            <tbody>
              <tr>
                <td colspan="28">
                  <bold>(</bold>
                  <bold>a)</bold>
                </td>
              </tr>
              <tr>
                <td colspan="2">
                  <bold>Profile</bold>
                </td>
                <td colspan="2">
                  <bold>ID01</bold>
                </td>
                <td colspan="2">
                  <bold>ID02</bold>
                </td>
                <td colspan="2">
                  <bold>ID03</bold>
                </td>
                <td colspan="3">
                  <bold>ID04</bold>
                </td>
                <td colspan="2">
                  <bold>ID05</bold>
                </td>
                <td colspan="2">
                  <bold>ID06</bold>
                </td>
                <td colspan="2">
                  <bold>ID07</bold>
                </td>
                <td colspan="3">
                  <bold>ID08</bold>
                </td>
                <td colspan="2">
                  <bold>ID09</bold>
                </td>
                <td colspan="2">
                  <bold>COM01</bold>
                </td>
                <td colspan="2">
                  <bold>COM02</bold>
                </td>
                <td colspan="2">
                  <bold>COM03</bold>
                </td>
              </tr>
              <tr>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">2</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">3</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">4</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">5</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">6</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">7</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">8</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">9</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">10</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">11</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">12</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="28">
                  <bold>(</bold>
                  <bold>b)</bold>
                </td>
              </tr>
              <tr>
                <td colspan="2">
                  <bold>Profile</bold>
                </td>
                <td colspan="2">
                  <bold>FIN01</bold>
                </td>
                <td colspan="2">
                  <bold>FIN02</bold>
                </td>
                <td colspan="2">
                  <bold>FIN03</bold>
                </td>
                <td colspan="3">
                  <bold>FIN04</bold>
                </td>
                <td colspan="2">
                  <bold>FIN05</bold>
                </td>
                <td colspan="2">
                  <bold>PREF01</bold>
                </td>
                <td colspan="2">
                  <bold>PREF02</bold>
                </td>
                <td colspan="3">
                  <bold>PREF03</bold>
                </td>
                <td colspan="2">
                  <bold>PREF04</bold>
                </td>
                <td colspan="2">
                  <bold>PREF05</bold>
                </td>
                <td colspan="2">
                  <bold>PREF06</bold>
                </td>
                <td colspan="2">
                  <bold>PREF07</bold>
                </td>
              </tr>
              <tr>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">2</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">3</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">4</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">5</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">6</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">7</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">8</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">9</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">10</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="2">11</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="3">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
              </tr>
              <tr>
                <td colspan="2">12</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="3">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
              </tr>
              <tr>
                <td colspan="28">
                  <bold>(</bold>
                  <bold>c)</bold>
                </td>
              </tr>
              <tr>
                <td>
                  <bold>Profile</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>08</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>09</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>10</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>11</bold>
                </td>
                <td>
                  <bold>PREF</bold>
                  <bold>12</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>13</bold>
                </td>
                <td colspan="2">
                  <bold>PREF</bold>
                  <bold>14</bold>
                </td>
                <td colspan="2">
                  <bold>LOC</bold>
                  <bold>01</bold>
                </td>
                <td colspan="2">
                  <bold>LOC</bold>
                  <bold>02</bold>
                </td>
                <td>
                  <bold>HLT</bold>
                  <bold>01</bold>
                </td>
                <td colspan="2">
                  <bold>HLT</bold>
                  <bold>02</bold>
                </td>
                <td colspan="2">
                  <bold>HLT</bold>
                  <bold>03</bold>
                </td>
                <td colspan="2">
                  <bold>HLT</bold>
                  <bold>04</bold>
                </td>
                <td colspan="2">
                  <bold>BIO</bold>
                  <bold>01</bold>
                </td>
                <td>
                  <bold>BIO</bold>
                  <bold>02</bold>
                </td>
              </tr>
              <tr>
                <td>1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>2</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>3</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>4</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td>1</td>
              </tr>
              <tr>
                <td>5</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>6</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>7</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td>1</td>
              </tr>
              <tr>
                <td>8</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>9</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>0</td>
              </tr>
              <tr>
                <td>10</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>0</td>
              </tr>
              <tr>
                <td>11</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
              <tr>
                <td>12</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">0</td>
                <td>0</td>
                <td colspan="2">0</td>
                <td colspan="2">0</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td colspan="2">1</td>
                <td>1</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Note. Column codes identify binary indicators within each information category; only category membership and the present/absent state enter the pricing calculation.</p>
      </sec>
      <sec id="sec9dot2">
        <title>S2. Verified Profile-Level Category Counts</title>
        <p><bold>Table S2</bold> reproduces the category count vector <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> used in the main-text numerical illustration and verifies that each row of <bold>Tables S1(a)-(c)</bold> yields the same profile totals.</p>
        <p><bold>Table S2.</bold>Profile counts and compensation regimes.</p>
        <table-wrap id="tbl10">
          <label>Table 10</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Profile</bold>
                </td>
                <td>
                  <bold>ID</bold>
                </td>
                <td>
                  <bold>Comm.</bold>
                </td>
                <td>
                  <bold>Fin.</bold>
                </td>
                <td>
                  <bold>Pref.</bold>
                </td>
                <td>
                  <bold>Loc.</bold>
                </td>
                <td>
                  <bold>Health</bold>
                </td>
                <td>
                  <bold>Bio.</bold>
                </td>
                <td>
                  <bold>Total</bold>
                </td>
                <td>
                  <bold>Regime</bold>
                </td>
              </tr>
              <tr>
                <td>1</td>
                <td>7</td>
                <td>1</td>
                <td>4</td>
                <td>6</td>
                <td>2</td>
                <td>0</td>
                <td>2</td>
                <td>22</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>2</td>
                <td>8</td>
                <td>2</td>
                <td>0</td>
                <td>9</td>
                <td>1</td>
                <td>0</td>
                <td>2</td>
                <td>22</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>3</td>
                <td>9</td>
                <td>0</td>
                <td>2</td>
                <td>1</td>
                <td>1</td>
                <td>4</td>
                <td>2</td>
                <td>19</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>4</td>
                <td>7</td>
                <td>2</td>
                <td>1</td>
                <td>9</td>
                <td>1</td>
                <td>3</td>
                <td>1</td>
                <td>24</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>5</td>
                <td>7</td>
                <td>3</td>
                <td>5</td>
                <td>12</td>
                <td>0</td>
                <td>3</td>
                <td>2</td>
                <td>32</td>
                <td>Privacy-sensitive</td>
              </tr>
              <tr>
                <td>6</td>
                <td>5</td>
                <td>1</td>
                <td>5</td>
                <td>11</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>28</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>7</td>
                <td>9</td>
                <td>2</td>
                <td>4</td>
                <td>14</td>
                <td>1</td>
                <td>2</td>
                <td>1</td>
                <td>33</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>8</td>
                <td>8</td>
                <td>2</td>
                <td>4</td>
                <td>4</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>24</td>
                <td>Risk-tolerant</td>
              </tr>
              <tr>
                <td>9</td>
                <td>8</td>
                <td>3</td>
                <td>2</td>
                <td>8</td>
                <td>1</td>
                <td>4</td>
                <td>1</td>
                <td>27</td>
                <td>Risk-tolerant</td>
              </tr>
              <tr>
                <td>10</td>
                <td>7</td>
                <td>1</td>
                <td>3</td>
                <td>10</td>
                <td>0</td>
                <td>2</td>
                <td>1</td>
                <td>24</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>11</td>
                <td>8</td>
                <td>2</td>
                <td>3</td>
                <td>9</td>
                <td>2</td>
                <td>2</td>
                <td>2</td>
                <td>28</td>
                <td>Benchmark</td>
              </tr>
              <tr>
                <td>12</td>
                <td>4</td>
                <td>3</td>
                <td>2</td>
                <td>4</td>
                <td>2</td>
                <td>4</td>
                <td>2</td>
                <td>21</td>
                <td>Benchmark</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec9dot3">
        <title>S3. Category Frequencies and Probability Inputs</title>
        <p>For category <italic>j</italic>, the presence probability <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the number of present binary states divided by the number of possible states across the 12 profiles. These probabilities supply the present-state Shannon contribution <inline-formula><mml:math display="inline"><mml:mrow><mml:mo> − </mml:mo><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> used in <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> .</p>
        <p><bold>Table S3.</bold>Frequency inputs used to calculate <inline-formula><mml:math display="inline"><mml:mrow><mml:mi> P </mml:mi><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> x </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . </p>
        <table-wrap id="tbl11">
          <label>Table 11</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Category</bold>
                </td>
                <td>
                  <bold>Attributes/profile</bold>
                </td>
                <td>
                  <bold>Present count</bold>
                </td>
                <td>
                  <bold>Opportunities</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:mi>P</mml:mi>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>x</mml:mi>
                              <mml:mrow>
                                <mml:mi>i</mml:mi>
                                <mml:mi>j</mml:mi>
                              </mml:mrow>
                            </mml:msub>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>−</bold>
                  <italic>
                    <bold>p</bold>
                  </italic>
                  <bold>log2</bold>
                  <italic>
                    <bold>p</bold>
                  </italic>
                </td>
              </tr>
              <tr>
                <td>Basic identity</td>
                <td>9</td>
                <td>87</td>
                <td>108</td>
                <td>0.8056</td>
                <td>0.2513</td>
              </tr>
              <tr>
                <td>Communication network</td>
                <td>3</td>
                <td>22</td>
                <td>36</td>
                <td>0.6111</td>
                <td>0.4342</td>
              </tr>
              <tr>
                <td>Financial</td>
                <td>5</td>
                <td>35</td>
                <td>60</td>
                <td>0.5833</td>
                <td>0.4536</td>
              </tr>
              <tr>
                <td>Preference</td>
                <td>14</td>
                <td>97</td>
                <td>168</td>
                <td>0.5774</td>
                <td>0.4575</td>
              </tr>
              <tr>
                <td>Location</td>
                <td>2</td>
                <td>15</td>
                <td>24</td>
                <td>0.6250</td>
                <td>0.4238</td>
              </tr>
              <tr>
                <td>Medical and health</td>
                <td>4</td>
                <td>28</td>
                <td>48</td>
                <td>0.5833</td>
                <td>0.4536</td>
              </tr>
              <tr>
                <td>Biometric</td>
                <td>2</td>
                <td>20</td>
                <td>24</td>
                <td>0.8333</td>
                <td>0.2192</td>
              </tr>
              <tr>
                <td>Total</td>
                <td>39</td>
                <td>304</td>
                <td>468</td>
                <td>0.6496 overall</td>
                <td>—</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
      </sec>
      <sec id="sec9dot4">
        <title>
          S4. Clarification of
          <italic>H</italic>
          <italic>
            <sub>i</sub>
          </italic>
          and Reproducibility Formula
        </title>
        <p>For a binary variable with presence probability <italic>p</italic>, full Shannon entropy is<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> B </mml:mi></mml:msub><mml:mtext>   </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> p </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> = </mml:mo><mml:mo> − </mml:mo><mml:mi> p </mml:mi><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mtext>   </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> p </mml:mi><mml:mo> ) </mml:mo></mml:mrow><mml:mo> − </mml:mo><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> p </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mtext>   </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:mn> 1 </mml:mn><mml:mo> − </mml:mo><mml:mi> p </mml:mi></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> . The pricing model does not use <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> B </mml:mi></mml:msub><mml:mtext>   </mml:mtext><mml:mrow><mml:mo> ( </mml:mo><mml:mi> p </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> as the record-level quantity because the monetary rule is applied only to attributes that are present and disclosed in a profile. Instead, it uses the present-state entropy contribution <inline-formula><mml:math display="inline"><mml:mrow><mml:mo> − </mml:mo><mml:mi> p </mml:mi><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mi> p </mml:mi><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , multiplied by the number of present attributes <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and the category sensitivity weight <italic>s</italic><italic><sub>j</sub></italic>. Thus<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub><mml:mo> = </mml:mo><mml:mo> − </mml:mo><mml:mstyle displaystyle="true"><mml:msub><mml:mo> ∑ </mml:mo><mml:mi> j </mml:mi></mml:msub><mml:mrow><mml:msub><mml:mi> T </mml:mi><mml:mrow><mml:mi> i </mml:mi><mml:mi> j </mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub><mml:msub><mml:mrow><mml:mi> log </mml:mi></mml:mrow><mml:mn> 2 </mml:mn></mml:msub><mml:mrow><mml:mo> ( </mml:mo><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow><mml:mo> ) </mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:math></inline-formula> . <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> should therefore be read as a sensitivity-weighted information-content term derived from Shannon entropy, not as the full binary Shannon entropy of the 39-dimensional profile. This terminology change clarifies the information-theoretic interpretation without changing any calculation.</p>
        <p><bold>Table S4.</bold>Reproducibility check for profile-level pricing outputs.</p>
        <table-wrap id="tbl12">
          <label>Table 12</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Profile</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>S</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <bold>Regime</bold>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>C</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <inline-formula>
                    <mml:math display="inline">
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>H</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:mrow>
                    </mml:math>
                  </inline-formula>
                </td>
                <td>
                  <italic>
                    <bold>V</bold>
                  </italic>
                  <bold>
                    <sub>0</sub>
                  </bold>
                  <bold>(yuan)</bold>
                </td>
                <td>
                  <bold>Reference price (yuan)</bold>
                </td>
              </tr>
              <tr>
                <td>1</td>
                <td>3.120</td>
                <td>Benchmark</td>
                <td>1.006</td>
                <td>1.121</td>
                <td>1500</td>
                <td>1691.112</td>
              </tr>
              <tr>
                <td>2</td>
                <td>3.103</td>
                <td>Privacy-sensitive</td>
                <td>1.149</td>
                <td>1.088</td>
                <td>1500</td>
                <td>1874.536</td>
              </tr>
              <tr>
                <td>3</td>
                <td>2.745</td>
                <td>Benchmark</td>
                <td>0.989</td>
                <td>0.898</td>
                <td>1500</td>
                <td>1331.387</td>
              </tr>
              <tr>
                <td>4</td>
                <td>3.334</td>
                <td>Privacy-sensitive</td>
                <td>1.159</td>
                <td>1.266</td>
                <td>1500</td>
                <td>2200.077</td>
              </tr>
              <tr>
                <td>5</td>
                <td>4.495</td>
                <td>Privacy-sensitive</td>
                <td>1.202</td>
                <td>1.751</td>
                <td>1500</td>
                <td>3155.288</td>
              </tr>
              <tr>
                <td>6</td>
                <td>3.941</td>
                <td>Benchmark</td>
                <td>1.035</td>
                <td>1.553</td>
                <td>1500</td>
                <td>2410.939</td>
              </tr>
              <tr>
                <td>7</td>
                <td>4.577</td>
                <td>Benchmark</td>
                <td>1.053</td>
                <td>1.775</td>
                <td>1500</td>
                <td>2803.900</td>
              </tr>
              <tr>
                <td>8</td>
                <td>3.394</td>
                <td>Risk-tolerant</td>
                <td>0.872</td>
                <td>1.214</td>
                <td>1500</td>
                <td>1586.564</td>
              </tr>
              <tr>
                <td>9</td>
                <td>3.745</td>
                <td>Risk-tolerant</td>
                <td>0.882</td>
                <td>1.421</td>
                <td>1500</td>
                <td>1880.111</td>
              </tr>
              <tr>
                <td>10</td>
                <td>3.359</td>
                <td>Benchmark</td>
                <td>1.015</td>
                <td>1.284</td>
                <td>1500</td>
                <td>1954.850</td>
              </tr>
              <tr>
                <td>11</td>
                <td>3.933</td>
                <td>Benchmark</td>
                <td>1.035</td>
                <td>1.461</td>
                <td>1500</td>
                <td>2267.381</td>
              </tr>
              <tr>
                <td>12</td>
                <td>2.958</td>
                <td>Benchmark</td>
                <td>0.999</td>
                <td>1.127</td>
                <td>1500</td>
                <td>1687.555</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>Reproducibility note. Calculations in the manuscript use unrounded category probabilities and compensation factors; displayed values are rounded for readability. Because within-category indicators share the same <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> s </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> p </mml:mi><mml:mi> j </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> , within-category column permutations in <bold>Table S1</bold> do not alter the reported <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi> H </mml:mi><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> or reference prices.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Acemoglu, D., Makhdoumi, A., Malekian, A., &amp; Ozdaglar, A. (2022). Too Much Data: Prices and Inefficiencies in Data Markets. <italic>American Economic Journal: Microeconomics, 14,</italic> 218-256. https://doi.org/10.1257/mic.20200200 <pub-id pub-id-type="doi">10.1257/mic.20200200</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1257/mic.20200200">https://doi.org/10.1257/mic.20200200</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Acemoglu, D.</string-name>
              <string-name>Makhdoumi, A.</string-name>
              <string-name>Malekian, A.</string-name>
              <string-name>Ozdaglar, A.</string-name>
            </person-group>
            <year>2022</year>
            <pub-id pub-id-type="doi">10.1257/mic.20200200</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Acquisti, A., Taylor, C., &amp; Wagman, L. (2016). The Economics of Privacy. <italic>Journal of Economic Literature, 54,</italic> 442-492. https://doi.org/10.1257/jel.54.2.442 <pub-id pub-id-type="doi">10.1257/jel.54.2.442</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1257/jel.54.2.442">https://doi.org/10.1257/jel.54.2.442</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Acquisti, A.</string-name>
              <string-name>Taylor, C.</string-name>
              <string-name>Wagman, L.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1257/jel.54.2.442</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Argenziano, R., &amp; Bonatti, A. (2023). Data Markets with Privacy-Conscious Consumers. <italic>AEA Papers and Proceedings, 113,</italic> 191-196. https://doi.org/10.1257/pandp.20231083 <pub-id pub-id-type="doi">10.1257/pandp.20231083</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1257/pandp.20231083">https://doi.org/10.1257/pandp.20231083</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Argenziano, R.</string-name>
              <string-name>Bonatti, A.</string-name>
            </person-group>
            <year>2023</year>
            <pub-id pub-id-type="doi">10.1257/pandp.20231083</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Balazinska, M., Howe, B., &amp; Suciu, D. (2011). Data Markets in the Cloud: An Opportunity for the Database Community. <italic>Proceedings of the VLDB Endowment, 4,</italic> 1482-1485. https://doi.org/10.14778/3402755.3402801 <pub-id pub-id-type="doi">10.14778/3402755.3402801</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.14778/3402755.3402801">https://doi.org/10.14778/3402755.3402801</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Balazinska, M.</string-name>
              <string-name>Howe, B.</string-name>
              <string-name>Suciu, D.</string-name>
            </person-group>
            <year>2011</year>
            <pub-id pub-id-type="doi">10.14778/3402755.3402801</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Bansal, G., Zahedi, F. M., &amp; Gefen, D. (2010). The Impact of Personal Dispositions on Information Sensitivity, Privacy Concern and Trust in Disclosing Health Information Online. <italic>Decision Support Systems, 49,</italic> 138-150. https://doi.org/10.1016/j.dss.2010.01.010 <pub-id pub-id-type="doi">10.1016/j.dss.2010.01.010</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.dss.2010.01.010">https://doi.org/10.1016/j.dss.2010.01.010</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Bansal, G.</string-name>
              <string-name>Zahedi, F.</string-name>
              <string-name>Gefen, D.</string-name>
              <string-name>Sensitivity, P</string-name>
            </person-group>
            <year>2010</year>
            <pub-id pub-id-type="doi">10.1016/j.dss.2010.01.010</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Bergemann, D., Bonatti, A., &amp; Gan, T. (2022). The Economics of Social Data. <italic>The RAND Journal of Economics, 53,</italic> 263-296. https://doi.org/10.1111/1756-2171.12407 <pub-id pub-id-type="doi">10.1111/1756-2171.12407</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1111/1756-2171.12407">https://doi.org/10.1111/1756-2171.12407</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Bergemann, D.</string-name>
              <string-name>Bonatti, A.</string-name>
              <string-name>Gan, T.</string-name>
            </person-group>
            <year>2022</year>
            <pub-id pub-id-type="doi">10.1111/1756-2171.12407</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Chua, H. N., Ooi, J. S., &amp; Herbland, A. (2021). The Effects of Different Personal Data Categories on Information Privacy Concern and Disclosure. <italic>Computers &amp; Security, 110,</italic> Article ID: 102453. https://doi.org/10.1016/j.cose.2021.102453 <pub-id pub-id-type="doi">10.1016/j.cose.2021.102453</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cose.2021.102453">https://doi.org/10.1016/j.cose.2021.102453</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Chua, H.</string-name>
              <string-name>Ooi, J.</string-name>
              <string-name>Herbland, A.</string-name>
            </person-group>
            <year>2021</year>
            <fpage>102453</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.cose.2021.102453</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Dai, J., Li, S., Liao, Z. et al. (2026). Research on Data Pricing Model Based on Privacy Compensation. <italic>Business and Management, No. 2,</italic> 10-18. (In Chinese)</mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Dai, J.</string-name>
              <string-name>Li, S.</string-name>
              <string-name>Liao, Z.</string-name>
              <string-name>Management, N</string-name>
            </person-group>
            <year>2026</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Green, P. E., &amp; Srinivasan, V. (1990). Conjoint Analysis in Marketing: New Developments with Implications for Research and Practice. <italic>Journal of Marketing, 54,</italic> 3-19. https://doi.org/10.1177/002224299005400402 <pub-id pub-id-type="doi">10.1177/002224299005400402</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1177/002224299005400402">https://doi.org/10.1177/002224299005400402</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Green, P.</string-name>
              <string-name>Srinivasan, V.</string-name>
            </person-group>
            <year>1990</year>
            <pub-id pub-id-type="doi">10.1177/002224299005400402</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Koutris, P., Upadhyaya, P., Balazinska, M., Howe, B., &amp; Suciu, D. (2012). Query-Based Data Pricing. In <italic>Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</italic> (pp. 167-178). ACM. https://doi.org/10.1145/2213556.2213582 <pub-id pub-id-type="doi">10.1145/2213556.2213582</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2213556.2213582">https://doi.org/10.1145/2213556.2213582</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Koutris, P.</string-name>
              <string-name>Upadhyaya, P.</string-name>
              <string-name>Balazinska, M.</string-name>
              <string-name>Howe, B.</string-name>
              <string-name>Suciu, D.</string-name>
            </person-group>
            <year>2012</year>
            <pub-id pub-id-type="doi">10.1145/2213556.2213582</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Lin, B. R., &amp; Kifer, D. (2014). On Arbitrage-Free Pricing for General Data Queries. <italic>Proceedings of the VLDB Endowment, 7,</italic> 757-768. https://doi.org/10.14778/2732939.2732948 <pub-id pub-id-type="doi">10.14778/2732939.2732948</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.14778/2732939.2732948">https://doi.org/10.14778/2732939.2732948</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Lin, B.</string-name>
              <string-name>Kifer, D.</string-name>
            </person-group>
            <year>2014</year>
            <pub-id pub-id-type="doi">10.14778/2732939.2732948</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Liu, H., Li, K., Chen, Y., &amp; Luo, X. (2023). Is Personally Identifiable Information Really More Valuable? Evidence from Consumers’ Willingness-to-Accept Valuation of Their Privacy Information. <italic>Decision Support Systems, 173,</italic> Article ID: 114010. https://doi.org/10.1016/j.dss.2023.114010 <pub-id pub-id-type="doi">10.1016/j.dss.2023.114010</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.dss.2023.114010">https://doi.org/10.1016/j.dss.2023.114010</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Liu, H.</string-name>
              <string-name>Li, K.</string-name>
              <string-name>Chen, Y.</string-name>
              <string-name>Luo, X.</string-name>
            </person-group>
            <year>2023</year>
            <fpage>114010</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1016/j.dss.2023.114010</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Luce, R. D., &amp; Tukey, J. W. (1964). Simultaneous Conjoint Measurement: A New Type of Fundamental Measurement. <italic>Journal of Mathematical Psychology, 1,</italic> 1-27. https://doi.org/10.1016/0022-2496(64)90015-x <pub-id pub-id-type="doi">10.1016/0022-2496(64)90015-x</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/0022-2496(64)90015-x">https://doi.org/10.1016/0022-2496(64)90015-x</ext-link></mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Luce, R.</string-name>
              <string-name>Tukey, J.</string-name>
            </person-group>
            <year>1964</year>
            <volume>2496</volume>
            <issue>64</issue>
            <pub-id pub-id-type="doi">10.1016/0022-2496(64)90015-x</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Shen, Y., Guo, B., Shen, Y., Duan, X., &amp; Hong, Y. (2016). A Pricing Model for Big Personal Data. <italic>Tsinghua Science and Technology, 21,</italic> 482-490. https://doi.org/10.1109/tst.2016.7590317 <pub-id pub-id-type="doi">10.1109/tst.2016.7590317</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tst.2016.7590317">https://doi.org/10.1109/tst.2016.7590317</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Shen, Y.</string-name>
              <string-name>Guo, B.</string-name>
              <string-name>Shen, Y.</string-name>
              <string-name>Duan, X.</string-name>
              <string-name>Hong, Y.</string-name>
            </person-group>
            <year>2016</year>
            <pub-id pub-id-type="doi">10.1109/tst.2016.7590317</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="book">State Administration for Market Regulation, &amp; National Standardization Administration (2020). <italic>Information Security Technology-Personal Information Security Specification (GB/T 35273-2020)</italic>. China Standard Press.</mixed-citation>
          <element-citation publication-type="book">
            <year>2020</year>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B16">
        <label>16.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Yu, H., &amp; Zhang, M. (2017). Data Pricing Strategy Based on Data Quality. <italic>Computers &amp; Industrial Engineering, 112,</italic> 1-10. https://doi.org/10.1016/j.cie.2017.08.008 <pub-id pub-id-type="doi">10.1016/j.cie.2017.08.008</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cie.2017.08.008">https://doi.org/10.1016/j.cie.2017.08.008</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Yu, H.</string-name>
              <string-name>Zhang, M.</string-name>
            </person-group>
            <year>2017</year>
            <pub-id pub-id-type="doi">10.1016/j.cie.2017.08.008</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B17">
        <label>17.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Yu, Y. H., Fu, Y., &amp; Wu, X. P. (2018). Metric and Classification Model for Privacy Data Based on Shannon Information Entropy and BP Neural Network. <italic>Journal on Communications, 39,</italic> 10-17. (In Chinese)</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Yu, Y.</string-name>
              <string-name>Fu, Y.</string-name>
              <string-name>Wu, X.</string-name>
            </person-group>
            <year>2018</year>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>