◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Parinya Chalermsook

2 papers hereh-index 18982 citations73 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1

Across the 1 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DS1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

most citedImproved Hardness of Approximation for Stackelberg Shortest-Path Pricing

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.GTShow all

1 paper · 1 filter

cs.GT2009

Stackelberg Pricing is Hard to Approximate within 2−ε

Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai

Stackelberg Pricing Games is a two-level combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider th…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.