Fairly taking turns
From MaRDI portal
Publication:6148409
DOI10.1016/J.GEB.2023.09.005zbMATH Open1530.91247MaRDI QIDQ6148409FDOQ6148409
Authors: Andrew Mackenzie, V. Komornik 
Publication date: 11 January 2024
Published in: Games and Economic Behavior (Search for Journal in Brave)
Recommendations
Cites Work
- Problems and theorems in analysis. I. Series, integral calculus, theory of functions. Transl. from the German by Dorothee Aeppli
- The bargaining problem
- Representations for real numbers and their ergodic properties
- Perfect Equilibrium in a Bargaining Model
- Title not available (Why is that?)
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- On Qualitative Probability $/sigma$-Algebras
- Title not available (Why is that?)
- Existence of an Equilibrium for a Competitive Economy
- College Admissions and the Stability of Marriage
- Valuating payoff streams under unequal discount factors
- A folk theorem for repeated games with unequal discounting
- Repeated Games with Differential Time Preferences
- Characterizing the limit set of perfect and public equilibrium payoffs with unequal discounting
- Stationary Ordinal Utility and Impatience
- Characterization of the unique expansions $1=\sum^{\infty}_{i=1}q^{-n_ i}$ and related problems
- On Equilibrium in Graham's Model of World Trade and Other Competitive Systems
- On the dispensability of public randomization in discounted repeated games
- Fair queueing
- On Repeated Games with Complete Information
- A Simple Proof of Descartes's Rule of Signs
- Reputation and Equilibrium Selection in Games with a Patient Player
- Truth, justice, and cake cutting
- How to Cut A Cake Fairly
- Truthful Fair Division
- On Low-Envy Truthful Allocations
- Sur la division pragmatique
- Almost envy-freeness with general valuations
- Strategy-proofness, solidarity, and consistency for multiple assignment problems
- The axioms and algebra of intuitive probability
- Old and new moving-knife schemes
- An Envy-Free Cake Division Protocol
- Achievement sets of sequences
- Strategy-proofness versus efficiency on restricted domains of exchange economies
- Taking turns
- Partitioning general probability measures
- Another Short Proof of Descartes's Rule of Signs
- Children crying at birthday parties. Why?
- Cake cutting algorithms for piecewise constant and piecewise uniform valuations
- A discrete and bounded envy-free cake cutting protocol for four agents
- Fairly allocating contiguous blocks of indivisible items
- On the existence of a probability measure compatible with a total preorder on a Boolean algebra
- Endogenous bid rotation in repeated auctions
- Near fairness in matroids
- Fair division with binary valuations: one rule to rule them all
- A foundation for probabilistic beliefs with or without atoms
- Making the Rules of Sports Fairer
- On multiple discount rates
- Almost envy-free allocations with connected bundles
- Designing practical and fair sequential team contests: the case of penalty shootouts
- Catch-up: a rule that makes service sports more competitive
- A Truthful Cardinal Mechanism for One-Sided Matching
- Consumption smoothing and discounting in infinite-horizon, discrete-choice problems
- On existence of truthful fair cake cutting mechanisms
This page was built for publication: Fairly taking turns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148409)
