◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jia Zhang

4 papers hereh-index 450 citations9 works total

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

author position
  • first author2
  • middle author2

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

fields
  • cs.DS2
  • cs.GT2
same name
  • Jia Zhang — 17 papers, h 22
  • Jia Zhang — 16 papers, h 11
  • Jia Zhang — 13 papers, h 6
  • Jia Zhang — 10 papers, h 12
  • Jia Zhang — 9 papers, h 12
  • Jia Zhang — 9 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedEfficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising

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

collaborators

4 papers

cs.DS2016★ 2 cited

Efficient Delivery Policy to Minimize User Traffic Consumption in Guaranteed Advertising

Jia Zhang, Zheng Wang, Qian Li +4

In this work, we study the guaranteed delivery model which is widely used in online display advertising. In the guaranteed delivery scenario, ad exposures (which are also called im…

cs.GT2016★ 1 cited

Randomized Mechanisms for Selling Reserved Instances in Cloud

Jia Zhang, Weidong Ma, Tao Qin +2

Selling reserved instances (or virtual machines) is a basic service in cloud computing. In this paper, we consider a more flexible pricing model for instance reservation, in which…

cs.GT2014★ 1 cited

Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games

Qizhi Fang, Bo Li, Xiaoming Sun +2

Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts t…

cs.DS2014

Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol

Xiaoming Sun, Jia Zhang, Jialin Zhang

The classical secretary problem investigates the question of how to hire the best secretary from n candidates who come in a uniformly random order. In this work we investigate a…

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