Kexin Chen

Ms. Kexin Chen


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2026 in Energies
Verified
Journal Article
Open access
PDF file
XCXinlei Cai
Xinlei Cai
KCKexin Chen
Kexin Chen
LJLizhou Jiang
Lizhou Jiang
RXRuichen Xu
Ruichen Xu
KDKai Dong
Kai Dong
ZMZijie Meng
Zijie Meng
The rapid proliferation of Large Language Models (LLMs) is increasing electricity demand from data centers, creating new challenges for power-demand forecasting and grid planning. A key difficulty is that architecture- and deployment-related information that affects inference load is often private to LLM providers. This paper proposes a two-stage, mechanism-assisted forecasting framework under information asymmetry. In the first stage, a stylized incentive mechanism elicits verifiable reduced-form demand parameters from LLM providers at a chosen reporting precision. In the second stage, the elicited parameters are incorporated into forecasting models as architecture- and deployment-informed features. Using calibrated synthetic scenarios constructed from public data-center energy reports, open LLM-inference energy benchmarks, and secondary public estimates, we find that incorporating elicited parameters reduces the mean squared error (MSE) of the ResNet forecasting backbone by 65.1% relative to an architecture-agnostic ResNet baseline. Similar improvements are observed for a gradient-boosting model, indicating that the main empirical value comes from procuring informative provider-side demand features rather than from a specific neural architecture. The results should be interpreted as a proof-of-concept demonstration rather than a full operational model of LLM serving or power-system dispatch.

14 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
KCKexin Chen
Kexin Chen
JHJianwei Huang
Jianwei Huang
YLYuan Luo
Yuan Luo
Generative Artificial Intelligence (GenAI) enables digital representatives to make decisions on behalf of team members in collaborative tasks, but faces challenges in accurately representing preferences. While supplying GenAI with detailed personal information improves representation fidelity, feasibility constraints make complete information access impractical. We bridge this gap by developing a game-theoretic framework that models strategic information revelation to GenAI in collective decision-making. The technical challenges lie in characterizing members' equilibrium behaviors under interdependent strategies and quantifying the imperfect preference learning outcomes by digital representatives. Our contribution includes closed-form equilibrium characterizations that reveal how members strategically balance team decision preference against communication costs. Our analysis yields an interesting finding: Conflicting preferences between team members drive competitive information revelation, with members revealing more information than those with aligned preferences. While digital representatives produce aggregate preference losses no smaller than direct participation, individual members may paradoxically achieve decisions more closely aligned with their preferences when using digital representatives, particularly when manual participation costs are high or when GenAI systems are sufficiently advanced.

18 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
KCKexin Chen
Kexin Chen
CHChao Huang
Chao Huang
JHJianwei Huang
Jianwei Huang
Information Elicitation Without Verification (IEWV) refers to the problem of eliciting high-accuracy solutions from crowd members when the ground truth is unverifiable. A high-accuracy team solution (aggregated from members' solutions) requires members' effort exertion, which should be incentivized properly. Previous research on IEWV mainly focused on scenarios where a central entity (e.g., the crowdsourcing platform) provides incentives to motivate crowd members. Still, the proposed designs do not apply to practical situations where no central entity exists. This paper studies the overlooked decentralized IEWV scenario, where crowd members act as both incentive contributors and task solvers. We model the interactions among members with heterogeneous team solution accuracy valuations as a two-stage game, where each member decides her incentive contribution strategy in Stage 1 and her effort exertion strategy in Stage 2. We analyze members' equilibrium behaviors under three incentive allocation mechanisms: Equal Allocation (EA), Output Agreement (OA), and Shapley Value (SV). We show that at an equilibrium under any allocation mechanism, a low-valuation member exerts no more effort than a high-valuation member. Counter-intuitively, a low-valuation member provides incentives to the collaboration while a high-valuation member does not at an equilibrium under SV. This is because a high-valuation member who values the aggregated team solution more needs fewer incentives to exert effort. In addition, when members' valuations are sufficiently heterogeneous, SV leads to team solution accuracy and social welfare no smaller than EA and OA.