pith. sign in

Approximate mechanism design without money

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

fields

cs.GT 2 cs.AI 1

years

2026 3

verdicts

UNVERDICTED 3

representative citing papers

Mechanism Design for Connecting Regions Under Disruptions

cs.GT · 2026-05-18 · unverdicted · novelty 6.0

Authors initiate mechanism design for reconnecting disrupted regions by characterizing all strategyproof anonymous mechanisms and bounding their approximation ratios for social and maximum cost objectives.

Strategic Facility Location with Limited Liars

cs.GT · 2026-04-18 · unverdicted · novelty 6.0

With k strategic liars out of n clients, Nash equilibria always exist with price of anarchy at most (n+2k)/(n-2k) (nearly tight), and strong equilibria exist on lines with cost at most (n+k)/(n-k) times optimal.

citing papers explorer

Showing 3 of 3 citing papers.

  • From Competition to Collaboration: Designing Sustainable Mechanisms Between LLMs and Online Forums cs.AI · 2026-02-04 · unverdicted · none · ref 40

    A new sequential interaction framework lets LLMs propose questions to forums, with simulations on real Stack Exchange data showing players can reach roughly half the utility of an ideal full-information scenario despite incentive misalignment.

  • Mechanism Design for Connecting Regions Under Disruptions cs.GT · 2026-05-18 · unverdicted · none · ref 26

    Authors initiate mechanism design for reconnecting disrupted regions by characterizing all strategyproof anonymous mechanisms and bounding their approximation ratios for social and maximum cost objectives.

  • Strategic Facility Location with Limited Liars cs.GT · 2026-04-18 · unverdicted · none · ref 18

    With k strategic liars out of n clients, Nash equilibria always exist with price of anarchy at most (n+2k)/(n-2k) (nearly tight), and strong equilibria exist on lines with cost at most (n+k)/(n-k) times optimal.