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 database1, Jinshan Zhang authored at least 31 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An efficient reinforcement learning approach for goal-based wealth management.
Expert Syst. Appl., March, 2024

2023
Exchange of indivisible goods under matroid constraints.
Inf. Comput., December, 2023

Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms.
Proceedings of the ACM Web Conference 2023, 2023

Reallocation Mechanisms Under Distributional Constraints in the Full Preference Domain.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Improved Truthful Rank Approximation for Rank-Maximal Matchings.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Truthful Mechanisms for Steiner Tree Problems.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Tight social welfare approximation of probabilistic serial.
Theor. Comput. Sci., 2022

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

2019
Size Versus Truthfulness in the House Allocation Problem.
Algorithmica, 2019

Network Pollution Games.
Algorithmica, 2019

2017
Pricing ad slots with consecutive multi-unit demand.
Auton. Agents Multi Agent Syst., 2017

2016
On revenue maximization with sharp multi-unit demands.
J. Comb. Optim., 2016

Multi-Unit Bayesian Auction with Demand or Budget Constraints.
Comput. Intell., 2016

House Markets with Matroid and Knapsack Constraints.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

New Results for Network Pollution Games.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Social Welfare in One-Sided Matching Mechanisms.
Proceedings of the Autonomous Agents and Multiagent Systems - AAMAS 2016 Workshops, - Best Papers, 2016

Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Welfare Ratios in One-Sided Matching Mechanisms.
CoRR, 2015

Envy-Free Sponsored Search Auctions with Budgets.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Revenue maximization in a Bayesian double auction market.
Theor. Comput. Sci., 2014

2013
On the theory of truthful and fair pricing for banner advertisements.
PhD thesis, 2013

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

Approximating partition functions of the two-state spin system.
Inf. Process. Lett., 2011

2009
Strong Spatial Mixing for Binary Markov Random Fields
CoRR, 2009

Approximating Partition Functions of Two-State Spin Systems
CoRR, 2009

2008
Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs
CoRR, 2008

An analysis of a random algorithm for estimating all the matchings
CoRR, 2008

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

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

Report on "American Option Pricing and Hedging Strategies"
CoRR, 2007

An analysis of a random algorithm for estimating all the matchings
CoRR, 2007


  Loading...