Jinshan Zhang

Orcid: 0000-0003-3427-9014

Affiliations:

Zhejiang University, Hangzhou, China
University of Liverpool, UK (PhD 2013)
Tsinghua University, China (former)

According to our database¹, Jinshan Zhang authored at least 35 papers between 2007 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Effective and Efficient Multi-View Imputation With Optimal Transport.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2024

An efficient reinforcement learning approach for goal-based wealth management.

[BibT_eX]

[DOI]

Expert Syst. Appl., March, 2024

A truthful near-optimal mechanism for online linear packing-covering problem in the random order model.

[BibT_eX]

[DOI]

Inf. Comput., 2024

Adaptive Fusion of Multi-View for Graph Contrastive Recommendation.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Recommender Systems, 2024

Decoupled Behavior-based Contrastive Recommendation.

[BibT_eX]

[DOI]

Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024

2023

Exchange of indivisible goods under matroid constraints.

[BibT_eX]

[DOI]

Jinshan Zhang

Bo Tang

Jianwei Yin

Inf. Comput., December, 2023

Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms.

[BibT_eX]

[DOI]

Proceedings of the ACM Web Conference 2023, 2023

Reallocation Mechanisms Under Distributional Constraints in the Full Preference Domain.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Improved Truthful Rank Approximation for Rank-Maximal Matchings.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Truthful Mechanisms for Steiner Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Tight social welfare approximation of probabilistic serial.

[BibT_eX]

[DOI]

Jinshan Zhang

Theor. Comput. Sci., 2022

No-regret Learning in Repeated First-Price Auctions with Budget Constraints.

[BibT_eX]

[DOI]

CoRR, 2022

2019

Size Versus Truthfulness in the House Allocation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2019

Network Pollution Games.

[BibT_eX]

[DOI]

Eleftherios Anastasiadis

Algorithmica, 2019

2017

Pricing ad slots with consecutive multi-unit demand.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2017

2016

On revenue maximization with sharp multi-unit demands.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Multi-Unit Bayesian Auction with Demand or Budget Constraints.

[BibT_eX]

[DOI]

Comput. Intell., 2016

House Markets with Matroid and Knapsack Constraints.

[BibT_eX]

[DOI]

Piotr Krysta

Jinshan Zhang

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Results for Network Pollution Games.

[BibT_eX]

[DOI]

Eleftherios Anastasiadis

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Social Welfare in One-Sided Matching Mechanisms.

[BibT_eX]

[DOI]

George Christodoulou

Aris Filos-Ratsikas

Søren Kristoffer Stiil Frederiksen

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

Proceedings of the Autonomous Agents and Multiagent Systems - AAMAS 2016 Workshops, - Best Papers, 2016

Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract).

[BibT_eX]

[DOI]

George Christodoulou

Aris Filos-Ratsikas

Søren Kristoffer Stiil Frederiksen

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Welfare Ratios in One-Sided Matching Mechanisms.

[BibT_eX]

[DOI]

George Christodoulou

Aris Filos-Ratsikas

Søren Kristoffer Stiil Frederiksen

Paul W. Goldberg

Jie Zhang

Jinshan Zhang

CoRR, 2015

Envy-Free Sponsored Search Auctions with Budgets.

[BibT_eX]

[DOI]

Bo Tang

Jinshan Zhang

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Revenue maximization in a Bayesian double auction market.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2013

On the theory of truthful and fair pricing for banner advertisements.

[BibT_eX]

[DOI]

Jinshan Zhang

PhD thesis, 2013

2011

An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs.

[BibT_eX]

[DOI]

Jinshan Zhang

Fengshan Bai

Theor. Comput. Sci., 2011

Approximating partition functions of the two-state spin system.

[BibT_eX]

[DOI]

Jinshan Zhang

Heng Liang

Fengshan Bai

Inf. Process. Lett., 2011

2009

Strong Spatial Mixing for Binary Markov Random Fields

[BibT_eX]

[DOI]

Jinshan Zhang

Heng Liang

Fengshan Bai

CoRR, 2009

Approximating Partition Functions of Two-State Spin Systems

[BibT_eX]

[DOI]

Jinshan Zhang

Heng Liang

Fengshan Bai

CoRR, 2009

2008

Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs

[BibT_eX]

[DOI]

Jinshan Zhang

CoRR, 2008

An analysis of a random algorithm for estimating all the matchings

[BibT_eX]

[DOI]

Jinshan Zhang

CoRR, 2008

Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains

[BibT_eX]

[DOI]

Jinshan Zhang

CoRR, 2008

2007

An Upper Bound for the Number of Hamiltonian Cycles on a Symmetric Diagraph

[BibT_eX]

[DOI]

Jinshan Zhang

CoRR, 2007

Report on "American Option Pricing and Hedging Strategies"

[BibT_eX]

[DOI]

Jinshan Zhang

CoRR, 2007

An analysis of a random algorithm for estimating all the matchings

[BibT_eX]

[DOI]

Jinshan Zhang

Yan Huo

Fengshan Bai

CoRR, 2007

Jinshan Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...