Steven J. Brams

From MaRDI portal
Person:483348

Available identifiers

zbMath Open brams.steven-jDBLP44/4432WikidataQ3499190 ScholiaQ3499190MaRDI QIDQ483348

List of research outcomes





PublicationDate of PublicationType
Fairer Shootouts in Soccer: The ( m, n ) Rule2025-01-16Paper
When to stop consulting2024-04-30Paper
How lies induced cooperation in \textit{Golden Balls}: a game-theoretic analysis2024-04-30Paper
Double moves by each player in chess openings make the game fairer2024-04-30Paper
Fairer Shootouts in Soccer: The $m-n$ Rule2023-02-11Paper
Obituary: Peter C. Fishburn (1936--2021)2022-07-22Paper
Three Persons, Two Cuts: A New Cake-Cutting Algorithm2022-05-09Paper
The excess method: a multiwinner approval voting procedure to allocate wasted votes2022-04-13Paper
Two-person fair division of indivisible items when envy-freeness is impossible2022-03-31Paper
Every normal-form game has a Pareto-optimal nonmyopic equilibrium2022-03-15Paper
Obituary: Peter C. Fishburn (1936--2021)2022-02-09Paper
Peter Fishburn2022-01-05Paper
Peter C. Fishburn (1936--2021)2021-12-10Paper
Peter C. Fishburn (1936--2021)2021-11-11Paper
Fair Division2021-02-15Paper
A note on stabilizing cooperation in the centipede game2021-01-26Paper
https://portal.mardi4nfdi.de/entity/Q45620092018-12-14Paper
Catch-Up: A Rule That Makes Service Sports More Competitive2018-11-09Paper
Making the Rules of Sports Fairer2018-02-13Paper
Going from Theory to Practice: The Mixed Success of Approval Voting2016-11-08Paper
Two-person fair division of indivisible items: an efficient envy-free algorithm2016-06-15Paper
Stabilizing Power Sharing2016-02-25Paper
https://portal.mardi4nfdi.de/entity/Q29396942015-01-22Paper
Two-person cake cutting: the optimal number of cuts2014-12-17Paper
Kingmakers and leaders in coalition formation2014-06-06Paper
The undercut procedure: an algorithm for the envy-free division of indivisible items2014-05-16Paper
<em>N</em>-Person Cake-Cutting: There May Be No Perfect Division2013-05-28Paper
Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm2012-02-11Paper
https://portal.mardi4nfdi.de/entity/Q31070752012-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30036422011-05-30Paper
Two-Person Pie-Cutting: The Fairest Cuts2011-05-16Paper
A note on the inefficiency of bidding over the price of a share2010-11-19Paper
https://portal.mardi4nfdi.de/entity/Q36567132010-01-13Paper
https://portal.mardi4nfdi.de/entity/Q36266782009-05-22Paper
Proportional pie-cutting2008-04-23Paper
https://portal.mardi4nfdi.de/entity/Q54500592008-03-19Paper
https://portal.mardi4nfdi.de/entity/Q54441552008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54431392008-02-20Paper
https://portal.mardi4nfdi.de/entity/Q54345842008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q34304152007-03-21Paper
https://portal.mardi4nfdi.de/entity/Q34125352006-12-27Paper
Going from theory to practice: the mixed success of approval voting2006-08-18Paper
Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity2005-09-20Paper
A nail-biting election2005-09-20Paper
The paradox of multiple elections2005-08-22Paper
Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q31558522005-01-18Paper
Fair division of indivisible items2004-08-20Paper
Cooperative vs non-cooperative truels: little agreement, but does that matter?2003-03-23Paper
https://portal.mardi4nfdi.de/entity/Q47862032002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q45463342002-08-20Paper
Agreement through threats: The Northern Ireland case2002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q42560872000-06-14Paper
The Truel2000-04-18Paper
Backward induction is not robust: The parity problem and the uncertainty problem1999-06-16Paper
https://portal.mardi4nfdi.de/entity/Q42203951999-01-03Paper
https://portal.mardi4nfdi.de/entity/Q42479331998-01-01Paper
https://portal.mardi4nfdi.de/entity/Q43389001997-06-02Paper
The Box Problem: To Switch or Not to Switch1997-02-23Paper
A moving-knife solution to the four-person envy-free cake-division problem1997-02-19Paper
Minimal winning coalitions in weighted-majority voting games1996-10-20Paper
Theory of Moves1996-01-14Paper
Old and new moving-knife schemes1995-11-29Paper
An Envy-Free Cake Division Protocol1995-05-04Paper
On envy-free cake division1995-04-04Paper
https://portal.mardi4nfdi.de/entity/Q43118931994-11-29Paper
Divide the dollar: Three solutions and extensions1994-09-05Paper
Game theory and literature1994-06-23Paper
Yes-no voting1993-05-16Paper
Coalition voting1993-01-16Paper
Optimal Threats1987-01-01Paper
Binding Versus Final-Offer Arbitration: A Combination is Best1986-01-01Paper
Proportional representation in variable-size legislatures1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33236291983-01-01Paper
Paradoxes of Preferential Voting1983-01-01Paper
Equilibrium Strategies for Final-Offer Arbitration: There is no Median Convergence1983-01-01Paper
Staying power in sequential games1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36744321983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47495481983-01-01Paper
Optimal resource allocation in presidential primaries1982-01-01Paper
Double deception: Two against one in three-person games1981-01-01Paper
Prisoners' Dilemama and Professional Sports Drafts1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30501911979-01-01Paper
Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges1978-01-01Paper

Research outcomes over time

This page was built for person: Steven J. Brams