| Publication | Date of Publication | Type |
|---|
| When to stop consulting | 2024-04-30 | Paper |
| How lies induced cooperation in \textit{Golden Balls}: a game-theoretic analysis | 2024-04-30 | Paper |
| Double moves by each player in chess openings make the game fairer | 2024-04-30 | Paper |
| Fairer Shootouts in Soccer: The $m-n$ Rule | 2023-02-11 | Paper |
| Obituary: Peter C. Fishburn (1936--2021) | 2022-07-22 | Paper |
| Three Persons, Two Cuts: A New Cake-Cutting Algorithm | 2022-05-09 | Paper |
| The excess method: a multiwinner approval voting procedure to allocate wasted votes | 2022-04-13 | Paper |
| Two-person fair division of indivisible items when envy-freeness is impossible | 2022-03-31 | Paper |
| Every normal-form game has a Pareto-optimal nonmyopic equilibrium | 2022-03-15 | Paper |
| Obituary: Peter C. Fishburn (1936--2021) | 2022-02-09 | Paper |
| Peter Fishburn | 2022-01-05 | Paper |
| Peter C. Fishburn (1936--2021) | 2021-12-10 | Paper |
| Peter C. Fishburn (1936--2021) | 2021-11-11 | Paper |
| Fair Division | 2021-02-15 | Paper |
| A note on stabilizing cooperation in the centipede game | 2021-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4562009 | 2018-12-14 | Paper |
| Catch-Up: A Rule That Makes Service Sports More Competitive | 2018-11-09 | Paper |
| Making the Rules of Sports Fairer | 2018-02-13 | Paper |
| Going from Theory to Practice: The Mixed Success of Approval Voting | 2016-11-08 | Paper |
| Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm | 2016-06-15 | Paper |
| Stabilizing Power Sharing | 2016-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2939694 | 2015-01-22 | Paper |
| Two-person cake cutting: the optimal number of cuts | 2014-12-17 | Paper |
| Kingmakers and leaders in coalition formation | 2014-06-06 | Paper |
| The undercut procedure: an algorithm for the envy-free division of indivisible items | 2014-05-16 | Paper |
| <em>N</em>-Person Cake-Cutting: There May Be No Perfect Division | 2013-05-28 | Paper |
| Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3107075 | 2012-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3003642 | 2011-05-30 | Paper |
| Two-Person Pie-Cutting: The Fairest Cuts | 2011-05-16 | Paper |
| A note on the inefficiency of bidding over the price of a share | 2010-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656713 | 2010-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3626678 | 2009-05-22 | Paper |
| Proportional pie-cutting | 2008-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5450059 | 2008-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5444155 | 2008-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443139 | 2008-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5434584 | 2008-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3430415 | 2007-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412535 | 2006-12-27 | Paper |
| Going from theory to practice: the mixed success of approval voting | 2006-08-18 | Paper |
| Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity | 2005-09-20 | Paper |
| A nail-biting election | 2005-09-20 | Paper |
| The paradox of multiple elections | 2005-08-22 | Paper |
| Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3155852 | 2005-01-18 | Paper |
| Fair division of indivisible items | 2004-08-20 | Paper |
| Cooperative vs non-cooperative truels: little agreement, but does that matter? | 2003-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4786203 | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4546334 | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2735129 | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256087 | 2000-06-14 | Paper |
| The Truel | 2000-04-18 | Paper |
| Backward induction is not robust: The parity problem and the uncertainty problem | 1999-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4220395 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247933 | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4338900 | 1997-06-02 | Paper |
| The Box Problem: To Switch or Not to Switch | 1997-02-23 | Paper |
| A moving-knife solution to the four-person envy-free cake-division problem | 1997-02-19 | Paper |
| Minimal winning coalitions in weighted-majority voting games | 1996-10-20 | Paper |
| Theory of Moves | 1996-01-14 | Paper |
| Old and new moving-knife schemes | 1995-11-29 | Paper |
| An Envy-Free Cake Division Protocol | 1995-05-04 | Paper |
| On envy-free cake division | 1995-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311893 | 1994-11-29 | Paper |
| Divide the dollar: Three solutions and extensions | 1994-09-05 | Paper |
| Game theory and literature | 1994-06-23 | Paper |
| Yes-no voting | 1993-05-16 | Paper |
| Coalition voting | 1993-01-16 | Paper |
| Optimal Threats | 1987-01-01 | Paper |
| Binding Versus Final-Offer Arbitration: A Combination is Best | 1986-01-01 | Paper |
| Proportional representation in variable-size legislatures | 1984-01-01 | Paper |
| Staying power in sequential games | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323629 | 1983-01-01 | Paper |
| Equilibrium Strategies for Final-Offer Arbitration: There is no Median Convergence | 1983-01-01 | Paper |
| Paradoxes of Preferential Voting | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674432 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749548 | 1983-01-01 | Paper |
| Optimal resource allocation in presidential primaries | 1982-01-01 | Paper |
| Double deception: Two against one in three-person games | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3050191 | 1979-01-01 | Paper |
| Prisoners' Dilemama and Professional Sports Drafts | 1979-01-01 | Paper |
| Optimal Jury Selection: A Game-Theoretic Model for the Exercise of Peremptory Challenges | 1978-01-01 | Paper |
