default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam S. Zwicker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Ayumi Igarashi, William S. Zwicker:
Fair division of graphs and of tangled cakes. Math. Program. 203(1): 931-975 (2024)- [c4]Jiehua Chen, William S. Zwicker:
Cutsets and EF1 Fair Division of Graphs. AAMAS 2024: 2192-2194 - [c3]Vincent Conitzer, Rachel Freedman, Jobst Heitzig, Wesley H. Holliday, Bob M. Jacobs, Nathan Lambert, Milan Mossé, Eric Pacuit, Stuart Russell, Hailey Schoelkopf, Emanuel Tewolde, William S. Zwicker:
Position: Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedback. ICML 2024 - [i7]Jiehua Chen, William S. Zwicker:
Cutsets and EF1 Fair Division of Graphs. CoRR abs/2402.05884 (2024) - [i6]Vincent Conitzer, Rachel Freedman, Jobst Heitzig, Wesley H. Holliday, Bob M. Jacobs, Nathan Lambert, Milan Mossé, Eric Pacuit, Stuart Russell, Hailey Schoelkopf, Emanuel Tewolde, William S. Zwicker:
Social Choice for AI Alignment: Dealing with Diverse Human Feedback. CoRR abs/2404.10271 (2024) - 2022
- [j19]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini
, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131: 197-221 (2022) - 2021
- [i5]Ayumi Igarashi, William S. Zwicker:
Fair division of graphs and of tangled cakes. CoRR abs/2102.08560 (2021)
2010 – 2019
- 2019
- [c2]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - 2018
- [j18]William S. Zwicker:
Cycles and Intractability in a Large Class of Aggregation Rules. J. Artif. Intell. Res. 61: 407-431 (2018) - [i4]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. CoRR abs/1808.09406 (2018) - 2017
- [c1]Jérôme Lang, Jérôme Monnot, Arkadii Slinko, William S. Zwicker:
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS 2017: 24-32 - 2016
- [j17]Conal Duddy, Ashley Piggins, William S. Zwicker:
Aggregation of binary evaluations: a Borda-like approach. Soc. Choice Welf. 46(2): 301-333 (2016) - [r1]William S. Zwicker:
Introduction to the Theory of Voting. Handbook of Computational Social Choice 2016: 23-56 - [i3]William S. Zwicker:
Cycles and Intractability in Social Choice Theory. CoRR abs/1608.03999 (2016) - 2014
- [j16]Nicolas Houy, William S. Zwicker:
The geometry of voting power: Weighted voting and hyper-ellipsoids. Games Econ. Behav. 84: 7-16 (2014) - 2012
- [j15]Felix Brandt, William S. Zwicker:
Special Issue on Computational Foundations of Social Choice. Math. Soc. Sci. 64(1): 1 (2012) - [j14]Davide P. Cervone, Ronghua Dai, Daniel Gnoutcheff, Grant Lanterman, Andrew Mackenzie, Ari Morse, Nikhil Srivastava, William S. Zwicker:
Voting with rubber bands, weights, and strings. Math. Soc. Sci. 64(1): 11-27 (2012) - [j13]M. Remzi Sanver, William S. Zwicker:
Monotonicity properties and their adaptation to irresolute social choice rules. Soc. Choice Welf. 39(2-3): 371-398 (2012) - 2010
- [j12]William S. Zwicker:
Annick Laruelle, Federico Valenciano, , Voting and Collective Decision Making: Bargaining and Power (2008) Cambridge University Press 184 pages. Games Econ. Behav. 69(2): 517-522 (2010) - [e1]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
Computational Foundations of Social Choice, 07.03. - 12.03.2010. Dagstuhl Seminar Proceedings 10101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i2]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Abstracts Collection - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010 - [i1]Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, William S. Zwicker:
10101 Executive Summary - Computational Foundations of Social Choice. Computational Foundations of Social Choice 2010
2000 – 2009
- 2009
- [j11]Josep Freixas, William S. Zwicker:
Anonymous yes-no voting with abstention and multiple levels of approval. Games Econ. Behav. 67(2): 428-444 (2009) - [j10]M. Remzi Sanver, William S. Zwicker:
One-way monotonicity as a form of strategy-proofness. Int. J. Game Theory 38(4): 553-574 (2009) - [p1]William S. Zwicker:
Anonymous Voting Rules with Abstention: Weighted Voting. The Mathematics of Preference, Choice and Order 2009: 239-258 - 2008
- [j9]William S. Zwicker:
Consistency without neutrality in voting rules: When is a vote an average? Math. Comput. Model. 48(9-10): 1357-1373 (2008) - [j8]William S. Zwicker:
A characterization of the rational mean neat voting rules. Math. Comput. Model. 48(9-10): 1374-1384 (2008) - 2003
- [j7]Nadia Burani, William S. Zwicker:
Coalition formation games with separable preferences. Math. Soc. Sci. 45(1): 27-52 (2003) - [j6]Josep Freixas, William S. Zwicker:
Weighted voting, abstention, and multiple levels of approval. Soc. Choice Welf. 21(3): 399-431 (2003) - 2000
- [j5]Alan D. Taylor, William S. Zwicker:
Trading properties and Alexandrov kernels for Boolean functions. Discret. Appl. Math. 107(1-3): 203-214 (2000)
1990 – 1999
- 1999
- [b1]Alan D. Taylor, William S. Zwicker:
Simple games - desirability relations, trading, pseudoweightings. Princeton University Press 1999, ISBN 978-0-691-00120-3, pp. I-XIII, 1-246 - 1995
- [j4]Alan D. Taylor, William S. Zwicker:
Simple Games and Magic Squares. J. Comb. Theory A 71(1): 67-88 (1995)
1980 – 1989
- 1989
- [j3]Arthur W. Apter, Carlos DiPrisco, James M. Henle, William S. Zwicker:
Filter Spaces: Toward a Unified Theory of Large Cardinals and Embedding Axioms. Ann. Pure Appl. Log. 41(2): 93-106 (1989) - 1986
- [j2]William S. Zwicker:
Pkappalambda Combinatorics II: The RK Ordering Beneath a Supercompact Measure. J. Symb. Log. 51(3): 604-616 (1986) - 1982
- [j1]James M. Henle, William S. Zwicker:
Ultrafilters on Spaces of Partitions. J. Symb. Log. 47(1): 137-146 (1982)
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-09-04 01:24 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:
