◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tean Lai

1 paper hereh-index 00 citations1 works total

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

author position
  • middle author1

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

fields
  • cs.GT1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

cs.GT2024

Verifying Cake-Cutting, Faster

Noah Bertram, Tean Lai, Justin Hsu

Envy-free cake-cutting protocols procedurally divide an infinitely divisible good among a set of agents so that no agent prefers another's allocation to their own. These protocols…

◍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.