◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. V. Upasany

2 papers hereh-index 27 citations4 works total

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

author position
  • last author2

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

fields
  • cs.GT2

identity via Semantic Scholar / OpenAlex

most citedConstructive comparison in bidding combinatorial games

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

collaborators

2 papers

cs.GT2022★ 1 cited

Constructive comparison in bidding combinatorial games

Prem Kant, Urban Larsson, Ravi K. Rai +1

A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning opt…

cs.GT2022

Bidding combinatorial games

Prem Kant, Urban Larsson, Ravi K. Rai +1

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention…

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