default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTon Storcken
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Shashwat Khare
, Ton Storcken:
Collective choice rules on restricted domains based on a priori information. Soc. Choice Welf. 59(3): 585-604 (2022)- 2021
- [j20]Burak Can, Mohsen Pourpouneh, Ton Storcken:
An axiomatic characterization of the Slater rule. Soc. Choice Welf. 56(4): 835-853 (2021) - 2020
- [j19]Edurne Falcó, Madhuparna Karmokar, Souvik Roy, Ton Storcken:
On update monotone, continuous, and consistent collective evaluation rules. Soc. Choice Welf. 55(4): 759-776 (2020)
2010 – 2019
- 2019
- [j18]Abhinaba Lahiri, Ton Storcken:
Strategy-proof location of public bads in an interval. Soc. Choice Welf. 53(1): 49-62 (2019) - 2017
- [j17]Abhinaba Lahiri, Hans Peters, Ton Storcken:
Strategy-proof location of public bads in a two-country model. Math. Soc. Sci. 90: 150-159 (2017) - 2015
- [j16]Burak Can, Ali Ihsan Ozkes, Ton Storcken:
Measuring polarization in preferences. Math. Soc. Sci. 78: 76-79 (2015) - 2013
- [j15]Burak Can, Ton Storcken:
Update monotone preference rules. Math. Soc. Sci. 65(2): 136-149 (2013) - 2012
- [j14]Hans Peters, Souvik Roy, Ton Storcken:
On the manipulability of approval voting and related scoring rules. Soc. Choice Welf. 39(2-3): 399-429 (2012)
2000 – 2009
- 2008
- [j13]Lars Ehlers, Ton Storcken:
Arrow's Possibility Theorem for one-dimensional single-peaked preferences. Games Econ. Behav. 64(2): 533-547 (2008) - 2007
- [j12]Stefan Maus, Hans Peters, Ton Storcken:
Anonymous voting and minimal manipulability. J. Econ. Theory 135(1): 533-544 (2007) - [j11]Stefan Maus, Hans Peters, Ton Storcken:
Minimally manipulable anonymous social choice functions. Math. Soc. Sci. 53(3): 239-254 (2007) - [j10]Stefan Maus, Hans Peters, Ton Storcken:
Minimal manipulability: anonymity and unanimity. Soc. Choice Welf. 29(2): 247-269 (2007) - 2005
- [j9]Bezalel Peleg, Hans Peters, Ton Storcken:
Constitutional implementation of social choice correspondences. Int. J. Game Theory 33(3): 381-396 (2005) - 2004
- [j8]Lars Ehlers, Hans Peters, Ton Storcken:
Threshold strategy-proofness: on manipulability in large voting problems. Games Econ. Behav. 49(1): 103-116 (2004) - [j7]Herman Monsuur, Ton Storcken:
Centers in Connected Undirected Graphs: An Axiomatic Approach. Oper. Res. 52(1): 54-64 (2004) - 2002
- [j6]Lars Ehlers, Hans Peters, Ton Storcken:
Strategy-Proof Probabilistic Decision Schemes for One-Dimensional Single-Peaked Preferences. J. Econ. Theory 105(2): 408-434 (2002) - [j5]Bezalel Peleg, Hans Peters, Ton Storcken:
Nash consistent representation of constitutions: a reaction to the Gibbard paradox. Math. Soc. Sci. 43(2): 267-287 (2002) - [j4]Bettina Klaus, Ton Storcken:
Choice correspondences for public goods. Soc. Choice Welf. 19(1): 127-154 (2002)
1990 – 1999
- 1997
- [j3]Ton Storcken:
Effectivity functions and simple games. Int. J. Game Theory 26(2): 235-248 (1997) - 1993
- [j2]Hans Peters, Hans van der Stel, Ton Storcken:
Generalized median solutions, strategy-proofness and strictly convex norms. ZOR Methods Model. Oper. Res. 38(1): 19-53 (1993) - [j1]Hans Peters, Hans van der Stel, Ton Storcken:
Range convexity, continuity, and strategy-proofness of voting schemes. ZOR Methods Model. Oper. Res. 38(2): 213-229 (1993)
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-08-27 21:59 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:
