Pith. sign in

REVIEW 3 cited by

How to Strategize Human Content Creation in the Era of GenAI?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.05187 v2 pith:XOK7SMO5 submitted 2024-06-07 cs.GT cs.AIcs.HCcs.LG

classification cs.GTcs.AIcs.HCcs.LG
keywords contenthumantimegenaicontentsalgorithmcreationdynamic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Generative AI (GenAI) will have significant impact on content creation platforms. In this paper, we study the dynamic competition between a GenAI and a human contributor. Unlike the human, the GenAI's content only improves when more contents are created by the human over time; however, GenAI has the advantage of generating content at a lower cost. We study the algorithmic problem in this dynamic competition model about how the human contributor can maximize her utility when competing against the GenAI for content generation over a set of topics. In time-sensitive content domains (e.g., news or pop music creation) where contents' value diminishes over time, we show that there is no polynomial time algorithm for finding the human's optimal (dynamic) strategy, unless the randomized exponential time hypothesis is false. Fortunately, we are able to design a polynomial time algorithm that naturally cycles between myopically optimizing over a short time window and pausing and provably guarantees an approximation ratio of $\frac{1}{2}$. We then turn to time-insensitive content domains where contents do not lose their value (e.g., contents on history facts). Interestingly, we show that this setting permits a polynomial time algorithm that maximizes the human's utility in the long run. Finally, we conduct simulations that demonstrate the advantage of our algorithms in comparison to a collection of baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Selective Response Strategies for GenAI

    cs.AI 2025-02 reject novelty 7.0 of 10

    Selective response, withholding answers to drive users to human forums, can in a stylized model increase both GenAI revenue and user welfare, and near-optimal policies can be computed approximately.

  2. Data Sharing with a Generative AI Competitor

    cs.GT 2025-05 conditional novelty 5.0 of 10

    In a two-stage data-sharing game, the unique equilibrium is either that the firm shares just enough data to stop the platform buying expert data, or that the firm shares an amount that maximizes its payoff while the p...

  3. Game Theory Meets Large Language Models: A Systematic Survey with Taxonomy and New Frontiers

    cs.AI 2025-02 conditional novelty 5.0 of 10

    A taxonomy-based survey of bidirectional game theory and LLM research, spanning evaluation, alignment, economic competition, and LLM-driven game solving.

Pith tools