![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jinshan Zhang 0001
Person information
- affiliation: Zhejiang University, Hangzhou, China
- affiliation (PhD 2013): University of Liverpool, UK
- affiliation (former): Tsinghua University, China
Other persons with the same name
- Jinshan Zhang 0002 — Inner Mongolia University of Science and Technology, School of Mines and Coal, Baotou, China
- Jinshan Zhang 0003 — Nanjing Hydraulic Research Institute, China
- Jinshan Zhang 0004 — Sichuan University of Science and Engineering, School of Science, Zigong, China
- Jinshan Zhang 0005 — Shandong University, School of Mechanical, Electrical and Information Engineering, Weihai, China
- Jinshan Zhang 0006 — Fudan University, Shanghai Engineering Research Center of AI & Robotics, Shanghai, China
- Jinshan Zhang 0007 — Hohai University, College of Hydrology and Water Resources, Nanjing, China
- Jinshan Zhang 0008 — Jilin University, School of Business and Management, Changchun, China
- Jinshan Zhang 0009 — University of Jinan, School of Information Science and Engineering, China
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
- [b1]Jinshan Zhang:
On the theory of truthful and fair pricing for banner advertisements. University of Liverpool, UK, 2013
Journal Articles
- 2024
- [j12]Jinshan Zhang
, Chengquan Wan
, Ming Chen, Hengjiang Liu:
An efficient reinforcement learning approach for goal-based wealth management. Expert Syst. Appl. 237(Part B): 121578 (2024) - [j11]Jinshan Zhang
, Xiaoye Miao, Meng Xi, Tianyu Du, Jianwei Yin:
A truthful near-optimal mechanism for online linear packing-covering problem in the random order model. Inf. Comput. 298: 105167 (2024) - 2023
- [j10]Jinshan Zhang
, Bo Tang, Jianwei Yin:
Exchange of indivisible goods under matroid constraints. Inf. Comput. 295(Part B): 105110 (2023) - 2022
- [j9]Jinshan Zhang
:
Tight social welfare approximation of probabilistic serial. Theor. Comput. Sci. 934: 1-6 (2022) - 2019
- [j8]Eleftherios Anastasiadis, Xiaotie Deng
, Piotr Krysta, Minming Li
, Han Qiao, Jinshan Zhang:
Network Pollution Games. Algorithmica 81(1): 124-166 (2019) - [j7]Piotr Krysta, David F. Manlove
, Baharak Rastegari
, Jinshan Zhang:
Size Versus Truthfulness in the House Allocation Problem. Algorithmica 81(9): 3422-3463 (2019) - 2017
- [j6]Xiaotie Deng
, Paul W. Goldberg
, Yang Sun, Bo Tang, Jinshan Zhang:
Pricing ad slots with consecutive multi-unit demand. Auton. Agents Multi Agent Syst. 31(3): 584-605 (2017) - 2016
- [j5]Xiaotie Deng
, Paul W. Goldberg
, Bo Tang, Jinshan Zhang:
Multi-Unit Bayesian Auction with Demand or Budget Constraints. Comput. Intell. 32(3): 355-368 (2016) - [j4]Ning Chen, Xiaotie Deng
, Paul W. Goldberg
, Jinshan Zhang:
On revenue maximization with sharp multi-unit demands. J. Comb. Optim. 31(3): 1174-1205 (2016) - 2014
- [j3]Xiaotie Deng
, Paul W. Goldberg
, Bo Tang, Jinshan Zhang:
Revenue maximization in a Bayesian double auction market. Theor. Comput. Sci. 539: 1-12 (2014) - 2011
- [j2]Jinshan Zhang
, Heng Liang, Fengshan Bai:
Approximating partition functions of the two-state spin system. Inf. Process. Lett. 111(14): 702-710 (2011) - [j1]Jinshan Zhang, Fengshan Bai:
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs. Theor. Comput. Sci. 412(4-5): 419-429 (2011)
Conference and Workshop Papers
- 2023
- [c13]Jinshan Zhang, Zhengyang Liu, Xiaotie Deng, Jianwei Yin:
Truthful Mechanisms for Steiner Tree Problems. AAAI 2023: 5884-5891 - [c12]Jinshan Zhang
, Zhengyang Liu
, Xiaotie Deng
, Jianwei Yin
:
Improved Truthful Rank Approximation for Rank-Maximal Matchings. WINE 2023: 637-653 - [c11]Jinshan Zhang
, Bo Tang, Xiaoye Miao
, Jianwei Yin
:
Reallocation Mechanisms Under Distributional Constraints in the Full Preference Domain. WINE 2023: 654-671 - [c10]Yongkang Guo
, Yuan Yuan
, Jinshan Zhang
, Yuqing Kong
, Zhihua Zhu
, Zheng Cai
:
Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms. WWW 2023: 3603-3613 - 2016
- [c9]Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang:
Network Pollution Games. AAMAS 2016: 23-31 - [c8]George Christodoulou
, Aris Filos-Ratsikas
, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg
, Jie Zhang
, Jinshan Zhang:
Social Welfare in One-Sided Matching Mechanisms. AAMAS Workshops (Selected Papers) 2016: 30-50 - [c7]George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang:
Social Welfare in One-Sided Matching Mechanisms: (Extended Abstract). AAMAS 2016: 1297-1298 - [c6]Eleftherios Anastasiadis, Xiaotie Deng
, Piotr Krysta, Minming Li
, Han Qiao, Jinshan Zhang:
New Results for Network Pollution Games. COCOON 2016: 39-51 - [c5]Piotr Krysta, Jinshan Zhang:
House Markets with Matroid and Knapsack Constraints. ICALP 2016: 141:1-141:14 - 2015
- [c4]Bo Tang, Jinshan Zhang:
Envy-Free Sponsored Search Auctions with Budgets. IJCAI 2015: 653-659 - 2014
- [c3]Piotr Krysta, David F. Manlove
, Baharak Rastegari
, Jinshan Zhang
:
Size versus truthfulness in the house allocation problem. EC 2014: 453-470 - 2013
- [c2]Xiaotie Deng
, Paul W. Goldberg
, Yang Sun, Bo Tang, Jinshan Zhang:
Pricing Ad Slots with Consecutive Multi-unit Demand. SAGT 2013: 255-266 - 2012
- [c1]Xiaotie Deng, Paul W. Goldberg
, Bo Tang, Jinshan Zhang:
Revenue Maximization in a Bayesian Double Auction Market. ISAAC 2012: 690-699
Informal and Other Publications
- 2023
- [i14]Yongkang Guo, Yuan Yuan
, Jinshan Zhang, Yuqing Kong, Zhihua Zhu, Zheng Cai:
Near-Optimal Experimental Design Under the Budget Constraint in Online Platforms. CoRR abs/2302.05005 (2023) - 2022
- [i13]Rui Ai, Chang Wang, Chenchen Li, Jinshan Zhang, Wenhan Huang, Xiaotie Deng:
No-regret Learning in Repeated First-Price Auctions with Budget Constraints. CoRR abs/2205.14572 (2022) - 2015
- [i12]George Christodoulou, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, Jie Zhang, Jinshan Zhang:
Welfare Ratios in One-Sided Matching Mechanisms. CoRR abs/1502.03849 (2015) - 2014
- [i11]Piotr Krysta, David F. Manlove, Baharak Rastegari, Jinshan Zhang:
Size versus truthfulness in the House Allocation problem. CoRR abs/1404.5245 (2014) - 2013
- [i10]Xiaotie Deng, Paul W. Goldberg, Yang Sun, Bo Tang, Jinshan Zhang:
Pricing Ad Slots with Consecutive Multi-unit Demand. CoRR abs/1308.1382 (2013) - 2012
- [i9]Ning Chen, Xiaotie Deng, Paul W. Goldberg, Jinshan Zhang:
On Revenue Maximization with Sharp Multi-Unit Demands. CoRR abs/1210.0203 (2012) - 2009
- [i8]Jinshan Zhang, Heng Liang, Fengshan Bai:
Approximating Partition Functions of Two-State Spin Systems. CoRR abs/0911.5486 (2009) - [i7]Jinshan Zhang, Heng Liang, Fengshan Bai:
Strong Spatial Mixing for Binary Markov Random Fields. CoRR abs/0911.5487 (2009) - 2008
- [i6]Jinshan Zhang:
Strong Spatial Mixing and Approximating Partition Functions of Two-State Spin Systems without Hard Constrains. CoRR abs/0812.0754 (2008) - [i5]Jinshan Zhang:
An analysis of a random algorithm for estimating all the matchings. CoRR abs/0812.1119 (2008) - [i4]Jinshan Zhang:
Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs. CoRR abs/0812.1123 (2008) - 2007
- [i3]Jinshan Zhang, Yan Huo, Fengshan Bai:
An analysis of a random algorithm for estimating all the matchings. CoRR abs/0711.1723 (2007) - [i2]Jinshan Zhang:
Report on "American Option Pricing and Hedging Strategies". CoRR abs/0711.4324 (2007) - [i1]Jinshan Zhang:
An Upper Bound for the Number of Hamiltonian Cycles on a Symmetric Diagraph. CoRR abs/0712.0616 (2007)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint