IDEAS home Printed from https://ideas.repec.org/f/pzh1151.html
   My authors  Follow this author

Ping Zhan

Personal Details

First Name:Ping
Middle Name:
Last Name:Zhan
Suffix:
RePEc Short-ID:pzh1151
[This author has chosen not to make the email address public]

Research output

as
Jump to: Articles

Articles

  1. Yasuko Matsui & Noriyoshi Sukegawa & Ping Zhan, 2023. "Monotone Diameter of Bisubmodular Polyhedra," SN Operations Research Forum, Springer, vol. 4(4), pages 1-16, December.
  2. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.
  3. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
  4. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.
  5. Ping Zhan, 2019. "A simple construction of complete single-peaked domains by recursive tiling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 477-488, December.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

  1. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.

    Cited by:

    1. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.

  2. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.

    Cited by:

    1. Ping Zhan, 2023. "A Simple Characterization of Assignment Mechanisms on Set Constraints," SN Operations Research Forum, Springer, vol. 4(2), pages 1-15, June.
    2. Ping Zhan, 2023. "Simultaneous eating algorithm and greedy algorithm in assignment problems," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-24, July.

  3. Ping Zhan, 2019. "A simple construction of complete single-peaked domains by recursive tiling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 477-488, December.

    Cited by:

    1. Alexander Karpov & Arkadii Slinko, 2023. "Constructing large peak-pit Condorcet domains," Theory and Decision, Springer, vol. 94(1), pages 97-120, January.
    2. Alexander Karpov, 2020. "The likelihood of single-peaked preferences under classic and new probability distribution assumptions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(4), pages 629-644, December.
    3. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Ping Zhan should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.