default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven J. Brams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j27]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Obituary: Peter C. Fishburn (1936-2021). Discret. Appl. Math. 310: 109-110 (2022)- [j26]Steven J. Brams, D. Marc Kilgour
, Christian Klamler:
Two-Person Fair Division of Indivisible Items when Envy-Freeness is Impossible. Oper. Res. Forum 3(2) (2022) - [j25]Steven J. Brams, Markus Brill, Anne-Marie George:
The excess method: a multiwinner approval voting procedure to allocate wasted votes. Soc. Choice Welf. 58(2): 283-300 (2022) - 2021
- [j24]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Peter C. Fishburn (1936-2021). Math. Soc. Sci. 113: 230-231 (2021) - [j23]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
Peter C. Fishburn (1936-2021). Soc. Choice Welf. 57(1): 1-3 (2021) - [c4]Steven J. Brams, Mehmet S. Ismail:
Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black. CoG 2021: 1-4 - [i5]Steven J. Brams, Mehmet S. Ismail:
Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black. CoRR abs/2108.02547 (2021) - 2020
- [j22]Steven J. Brams, D. Marc Kilgour:
A Note on Stabilizing Cooperation in the Centipede Game. Games 11(3): 35 (2020)
2010 – 2019
- 2018
- [j21]Steven J. Brams, Mehmet S. Ismail:
Making the Rules of Sports Fairer. SIAM Rev. 60(1): 181-202 (2018) - [j20]Steven J. Brams, Mehmet S. Ismail, D. Marc Kilgour, Walter Stromquist:
Catch-Up: A Rule That Makes Service Sports More Competitive. Am. Math. Mon. 125(9): 771-796 (2018) - 2013
- [b9]Steven J. Brams:
Game Theory and Politics. Dover Books on Science, Dover Publications 2013, ISBN 978-0-486-43497-1, pp. I-XIX, 1-312 - [j19]Steven J. Brams, D. Marc Kilgour:
Kingmakers and leaders in coalition formation. Soc. Choice Welf. 41(1): 1-18 (2013) - [j18]Steven J. Brams, Michael A. Jones, Christian Klamler:
N-Person Cake-Cutting: There May Be No Perfect Division. Am. Math. Mon. 120(1): 35-47 (2013) - 2012
- [j17]Steven J. Brams, D. Marc Kilgour, Christian Klamler:
The undercut procedure: an algorithm for the envy-free division of indivisible items. Soc. Choice Welf. 39(2-3): 615-631 (2012) - [c3]Steven J. Brams, Michal Feldman, John K. Lai, Jamie Morgenstern, Ariel D. Procaccia:
On Maxsum Fair Cake Divisions. AAAI 2012: 1285-1291 - 2011
- [b8]Steven J. Brams:
Game Theory and the Humanities - Bridging Two Worlds. MIT Press 2011, ISBN 978-0-262-01522-6, pp. I-XI, 1-319 - [j16]Steven J. Brams, Michael A. Jones, Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm. SIAM Rev. 53(2): 291-307 (2011) - [c2]D. Marc Kilgour, Steven J. Brams, Todd R. Kaplan:
Three procedures for inducing honesty in bargaining. TARK 2011: 170-176 - 2010
- [j15]Stergios Athanassoglou, Steven J. Brams, Jay Sethuraman:
A note on the inefficiency of bidding over the price of a share. Math. Soc. Sci. 60(3): 191-195 (2010)
2000 – 2009
- 2009
- [j14]Julius B. Barbanel, Steven J. Brams, Walter Stromquist:
Cutting a Pie Is Not a Piece of Cake. Am. Math. Mon. 116(6): 496-514 (2009) - [p1]Steven J. Brams, M. Remzi Sanver:
Voting Systems that Combine Approval and Preference. The Mathematics of Preference, Choice and Order 2009: 215-237 - [e2]Steven J. Brams, William V. Gehrlein, Fred S. Roberts:
The Mathematics of Preference, Choice and Order. Studies in Choice and Welfare, Springer 2009, ISBN 978-3-540-79127-0 [contents] - [r1]Steven J. Brams:
Fair Division*. Encyclopedia of Complexity and Systems Science 2009: 3327-3334 - 2008
- [b7]Steven J. Brams:
The Presidential Election Game, 2nd edition. CRC Press 2008, ISBN 978-1-568-81348-6, pp. I-XXII, 1-194 - [j13]Steven J. Brams, Michael A. Jones, Christian Klamler:
Proportional pie-cutting. Int. J. Game Theory 36(3-4): 353-367 (2008) - [j12]Steven J. Brams:
Mathematics and democracy: Designing better voting and fair-division procedures. Math. Comput. Model. 48(9-10): 1666-1670 (2008) - 2007
- [b6]Steven J. Brams:
Mathematics and democracy - designing better voting and fair-division procedures. Princeton University Press 2007, ISBN 978-0-691-13321-8, pp. I-XVI, 1-373 - [b5]Steven J. Brams, Peter C. Fishburn:
Approval voting, 2nd edition. Springer 2007, ISBN 978-0-387-49895-9, pp. I-XXI, 1-198 - [b4]Steven J. Brams:
Superior beings - if they exist, how would we know: game-theoretic implications of omniscience, omnipotence, immortality, and incomprehensibility, 2nd edition. Springer 2007, ISBN 978-0-387-48065-7, pp. I-XXII, 1-202 - [e1]Steven J. Brams, Kirk Pruhs, Gerhard J. Woeginger:
Fair Division, 24.06. - 29.06.2007. Dagstuhl Seminar Proceedings 07261, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [i4]Steven J. Brams, Michael A. Jones, Christian Klamler:
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. Fair Division 2007 - [i3]Steven J. Brams, Michael A. Jones, Christian Klamler:
Better Ways to Cut a Cake - Revisited. Fair Division 2007 - [i2]Steven J. Brams, Kirk Pruhs:
07261 Summary -- Fair Division. Fair Division 2007 - [i1]Steven J. Brams, Kirk Pruhs:
07261 Abstracts Collection -- Fair Division. Fair Division 2007 - 2005
- [j11]Steven J. Brams, Peter C. Fishburn:
Going from theory to practice: the mixed success of approval voting. Soc. Choice Welf. 25(2-3): 457-474 (2005) - 2004
- [j10]Julius B. Barbanel, Steven J. Brams:
Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond. Math. Soc. Sci. 48(3): 251-269 (2004) - 2003
- [c1]Steven J. Brams, Michael A. Jones, D. Marc Kilgour:
Dynamic models of coalition formation: fallback vs. build-up. TARK 2003: 187-200 - 2002
- [j9]Walter Bossert, Steven J. Brams, D. Marc Kilgour:
Cooperative vs non-cooperative truels: little agreement, but does that matter? Games Econ. Behav. 40(2): 185-202 (2002) - 2001
- [j8]Steven J. Brams, Peter C. Fishburn:
A nail-biting election. Soc. Choice Welf. 18(3): 409-414 (2001) - 2000
- [b3]Steven J. Brams, Alan D. Taylor:
The win-win solution - guaranteeing fair shares to everybody. W. W. Norton & Company 2000, ISBN 978-0-393-32081-7, pp. I-XI, 1-177 - [j7]Steven J. Brams, Peter C. Fishburn:
Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity. Soc. Choice Welf. 17(2): 247-267 (2000)
1990 – 1999
- 1999
- [j6]Steven J. Brams, Jeffrey M. Togman:
Agreement through Threats: the Northern Ireland Case. IGTR 1(3-4): 251-265 (1999) - 1996
- [b2]Steven J. Brams, Alan D. Taylor:
Fair division - from cake-cutting to dispute resolution. Cambridge University Press 1996, ISBN 978-0-521-55644-6, pp. I-XIV, 1-272 - 1995
- [j5]Steven J. Brams:
On Envy-Free Cake Division. J. Comb. Theory A 70(1): 170-173 (1995)
1980 – 1989
- 1988
- [b1]Steven J. Brams, D. Marc Kilgour:
Game Theory and National Security. Wiley 1988, ISBN 978-1-55786-003-3, pp. I-IX, 1-199 - 1987
- [j4]Steven J. Brams, D. Marc Kilgour:
Optimal Threats. Oper. Res. 35(4): 524-536 (1987) - 1982
- [j3]Steven J. Brams, Morton D. Davis:
Optimal resource allocation in presidential primaries. Math. Soc. Sci. 3(4): 373-388 (1982) - 1980
- [j2]Steven J. Brams, Morton D. Davis:
Letter to the Editor - Authors' Rejoinder. Oper. Res. 28(4): 1024-1025 (1980)
1970 – 1979
- 1978
- [j1]Steven J. Brams, Morton D. Davis:
Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges. Oper. Res. 26(6): 966-991 (1978)
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-06-10 20:32 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:
