{"total":13,"rows":[{"id":"2103.01028","title":"Information Discrepancy in Strategic Learning","created":"2021-03-01","cited_by_count":48,"area":null},{"id":"2102.08358","title":"Efficient Competitions and Online Learning with Strategic Forecasters","created":"2021-02-16","cited_by_count":9,"area":null},{"id":"2406.00551","title":"Strategic Linear Contextual Bandits","created":"2024-06-01","cited_by_count":5,"area":null},{"id":"2207.02847","title":"Scoring Rules for Performative Binary Prediction","created":"2022-07-05","cited_by_count":3,"area":null},{"id":"2211.08494","title":"Who Reviews The Reviewers? A Multi-Level Jury Problem","created":"2022-11-15","cited_by_count":2,"area":null},{"id":"2303.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2505.23720","title":"COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents","created":"2025-05-29","cited_by_count":1,"area":null},{"id":"2305.15331","title":"No-Regret Online Prediction with Strategic Experts","created":"2023-05-24","cited_by_count":0,"area":null},{"id":"2404.05155","title":"On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX","created":"2024-04-08","cited_by_count":0,"area":null},{"id":"2405.06480","title":"Incentive-compatible Bandits: Importance Weighting No More","created":"2024-05-10","cited_by_count":0,"area":null},{"id":"2502.11483","title":"No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts","created":"2025-02-17","cited_by_count":0,"area":null},{"id":"2605.24052","title":"Truthful Online Preference Aggregation for LLM Fine-Tuning in Mobile Crowdsourcing","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2607.04389","title":"Decentralized Aggregation of LLM Predictions via Wagering Mechanisms","created":"2026-07-05","cited_by_count":0,"area":null}],"next_cursor":null}