default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoungsub Chun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]René van den Brink
, Youngsub Chun, Yukihiko Funaki, Zhengxing Zou:
Balanced externalities and the proportional allocation of nonseparable contributions. Eur. J. Oper. Res. 307(2): 975-983 (2023)- [j31]Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami:
Balanced VCG mechanisms for sequencing problems. Soc. Choice Welf. 60(1-2): 35-46 (2023) - 2022
- [j30]Gustavo Bergantiños, Youngsub Chun, Eunju Lee, Leticia Lorenzo:
The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources. IGTR 24(1): 2150007:1-2150007:36 (2022) - 2021
- [j29]Zhengxing Zou, René van den Brink, Youngsub Chun, Yukihiko Funaki:
Axiomatizations of the proportional division value. Soc. Choice Welf. 57(1): 35-62 (2021) - 2020
- [j28]Youngsub Chun, Kiyong Yun:
Upper-contour strategy-proofness in the probabilistic assignment problem. Soc. Choice Welf. 54(4): 667-687 (2020)
2010 – 2019
- 2019
- [j27]Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami:
A characterization of the symmetrically balanced VCG rule in the queueing problem. Games Econ. Behav. 118: 486-490 (2019) - 2017
- [j26]Youngsub Chun, Duygu Yengin:
Welfare lower bounds and strategy-proofness in the queueing problem. Games Econ. Behav. 102: 462-476 (2017) - [j25]Hee-In Chang, Youngsub Chun:
Probabilistic assignment of indivisible objects when agents have the same preferences except the ordinal ranking of one object. Math. Soc. Sci. 90: 80-92 (2017) - [j24]Paulo Barelli, Youngsub Chun, John Duggan:
Introduction to the special issue in honor of William Thomson. Soc. Choice Welf. 48(1): 1-4 (2017) - [j23]Youngsub Chun, Boram Park:
A graph theoretic approach to the slot allocation problem. Soc. Choice Welf. 48(1): 133-152 (2017) - [j22]Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami:
Reordering an existing queue. Soc. Choice Welf. 49(1): 65-87 (2017) - 2016
- [j21]Youngsub Chun, Nari Park, Duygu Yengin:
Coincidence of cooperative game theoretic solutions in the appointment problem. Int. J. Game Theory 45(3): 699-708 (2016) - 2015
- [j20]Sunyoung Kim, Gustavo Bergantiños, Youngsub Chun:
The separability principle in single-peaked economies with participation constraints. Math. Soc. Sci. 78: 69-75 (2015) - 2014
- [j19]Youngsub Chun, Manipushpak Mitra:
Subgroup additivity in the queueing problem. Eur. J. Oper. Res. 238(1): 281-289 (2014) - [j18]Yuan Ju, Youngsub Chun, René van den Brink:
Auctioning and selling positions: A non-cooperative approach to queueing conflicts. J. Econ. Theory 153: 33-45 (2014) - [j17]Youngsub Chun, Manipushpak Mitra, Suresh Mutuswami:
Characterizations of pivotal mechanisms in the queueing problem. Math. Soc. Sci. 72: 62-66 (2014) - [j16]Youngsub Chun, Inkee Jang, Biung-Ghi Ju:
Priority, solidarity and egalitarianism. Soc. Choice Welf. 43(3): 577-589 (2014) - 2012
- [j15]Youngsub Chun, Boram Park:
Population solidarity, population fair-ranking, and the egalitarian value. Int. J. Game Theory 41(2): 255-270 (2012) - [j14]Youngsub Chun, Joosung Lee:
Sequential contributions rules for minimum cost spanning tree problems. Math. Soc. Sci. 64(2): 136-143 (2012) - [j13]René van den Brink, Youngsub Chun:
Balanced consistency and balanced cost reduction for sequencing problems. Soc. Choice Welf. 38(3): 519-529 (2012) - 2011
- [j12]Youngsub Chun:
Consistency and monotonicity in sequencing problems. Int. J. Game Theory 40(1): 29-41 (2011) - 2010
- [j11]Sunghoon Hong, Youngsub Chun:
Efficiency and stability in a model of wireless communication networks. Soc. Choice Welf. 34(3): 441-454 (2010)
2000 – 2009
- 2007
- [j10]Youngsub Chun, Junghoon Lee:
On the convergence of the random arrival rule in large claims problems. Int. J. Game Theory 36(2): 259-273 (2007) - 2006
- [j9]Youngsub Chun:
A pessimistic approach to the queueing problem. Math. Soc. Sci. 51(2): 171-181 (2006) - [j8]Youngsub Chun:
The Separability Principle in Economies with Single-Peaked Preferences. Soc. Choice Welf. 26(2): 239-253 (2006) - 2005
- [j7]Youngsub Chun, William Thomson:
Convergence under replication of rules to adjudicate conflicting claims. Games Econ. Behav. 50(2): 129-142 (2005) - [j6]Youngsub Chun:
The replacement principle in bargaining. Soc. Choice Welf. 25(1): 141-154 (2005) - 2004
- [j5]Youngsub Chun:
On weighted Kalai-Samet solutions for non-transferable utility coalitional form games. Games Econ. Behav. 47(2): 257-267 (2004) - 2002
- [j4]Youngsub Chun:
The Converse Consistency Principle in Bargaining. Games Econ. Behav. 40(1): 25-43 (2002) - 2000
- [j3]Youngsub Chun:
Agreement, separability, and other axioms for quasi-linear social choice problems. Soc. Choice Welf. 17(3): 507-521 (2000)
1990 – 1999
- 1999
- [j2]Youngsub Chun:
Equivalence of axioms for bankruptcy problems. Int. J. Game Theory 28(4): 511-520 (1999)
1980 – 1989
- 1989
- [j1]Youngsub Chun:
Lexicographic egalitarian solution and uncertainty in the disagreement point. ZOR Methods Model. Oper. Res. 33(4): 259-266 (1989)
Coauthor Index
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-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
