Scott Duke Kominers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Scott Duke Kominers has a total of 193 co-authors. Here are the top co-authors by number of shared publications:
- John William Hatfield
Graduate School of Business, Stanford University, 655 Knight Way, Stanford, CA 94305
12 shared publications - Noam D. Elkies
Department of Mathematics, Harvard University, Cambridge, USA
4 shared publications Zachary Abel
4 shared publicationsAlexander Westkamp
University of Cologne, Cologne, Germany
3 shared publications- Alfred Galichon
Economics Department New York University Sciences Po Paris
3 shared publications Edward L. Glaeser
Department of Economics Harvard University Cambridge Massachusetts USA
3 shared publications
Latest Publications
- 3 September 2026
- Published by Taylor & Francis in The Fibonacci Quarterly
- p. 1-10
Uniform Bounds for Digit-Appending Fibonacci Walks
1. An at-most-N-digit-appending walk along the Fibonacci sequence in base b≥2 proceeds as follows: start from a Fibonacci number M0:=Fm with m≥1 and, at each step M0,M1,M2,…, append between 1 and N...
- 3 September 2026
- Published by Taylor & Francis in The Fibonacci Quarterly
- p. 1-10
Uniform Bounds for Digit-Appending Fibonacci Walks
1. An at-most-N-digit-appending walk along the Fibonacci sequence in base b≥2 proceeds as follows: start from a Fibonacci number M0:=Fm with m≥1 and, at each step M0,M1,M2,…, append between 1 and N...
- 21 April 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 114 (3) , 411-420
SIMULTANEOUS NIVEN NUMBERS IN ARITHMETIC PROGRESSIONS FOR POWER-RELATED BASES
Recently, Harrington et al. [‘Every arithmetic progression contains infinitely many b -Niven numbers’, Bull. Aust. Math. Soc. 109 (3) (2024), 409–413] proved that every arithmetic progression contains infinitely many base- b Niven numbers for any fixed $b\ge 2$ b greater than or equals 2 . We use a sparse repunit construction to treat a structured two-base version of the same problem, showing that every arithmetic progression with common difference relatively prime to b contains infinitely many integers that are simultaneously b -Niven and $b^k$ b Superscript k -Niven (indeed, we can obtain simultaneous $b^\ell $ b Superscript script l -Niven-ness for $\ell =1,\ldots , k$ script l equals 1 comma ellipsis comma k ).- 21 April 2026
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 114 (3) , 411-420
SIMULTANEOUS NIVEN NUMBERS IN ARITHMETIC PROGRESSIONS FOR POWER-RELATED BASES
Recently, Harrington et al. [‘Every arithmetic progression contains infinitely many b -Niven numbers’, Bull. Aust. Math. Soc. 109 (3) (2024), 409–413] proved that every arithmetic progression contains infinitely many base- b Niven numbers for any fixed $b\ge 2$ b greater than or equals 2 . We use a sparse repunit construction to treat a structured two-base version of the same problem, showing that every arithmetic progression with common difference relatively prime to b contains infinitely many integers that are simultaneously b -Niven and $b^k$ b Superscript k -Niven (indeed, we can obtain simultaneous $b^\ell $ b Superscript script l -Niven-ness for $\ell =1,\ldots , k$ script l equals 1 comma ellipsis comma k ).- 7 January 2026
- Published by Elsevier in European Economic Review
- Vol. 187
Strategy-proofness, investment efficiency, and marginal returns: An equivalence
- 7 January 2026
- Published by Elsevier in European Economic Review
- Vol. 187
Strategy-proofness, investment efficiency, and marginal returns: An equivalence
- Open Access
A Flanking Pattern in a Sum-of-Divisors Congruence
We consider composite $n$ satisfying the congruence $$n \cdot σ_k(n) \equiv 2 \pmod{φ(n)},$$ and show a "flanking" structure: $14$ appears in both $S_{k-1}$ and $S_{k+1}$ whenever certain values of $n$ appear in $S_k$; and, moreover, $14$ is the only (nontrivial) case of this property. Along the way, we derive a new characterization of the $n$ that appear in the sets $S_{k}$.Open AccessA Flanking Pattern in a Sum-of-Divisors Congruence
We consider composite $n$ satisfying the congruence $$n \cdot σ_k(n) \equiv 2 \pmod{φ(n)},$$ and show a "flanking" structure: $14$ appears in both $S_{k-1}$ and $S_{k+1}$ whenever certain values of $n$ appear in $S_k$; and, moreover, $14$ is the only (nontrivial) case of this property. Along the way, we derive a new characterization of the $n$ that appear in the sets $S_{k}$. - Open Access
Uniform Bounds for Digit-Appending Fibonacci Walks
Building on the work of Miller et al. [Fibonacci Quarterly, 2022], we show that it is impossible to "walk to infinity" along the Fibonacci sequence in any integer base $b\geq 2$ when at most $N$ digits are appended per step. Our proof method is base-independent, yielding the bound \[L \;\leq\; 2N\log_\varphi b \,+\, O(1),\] uniformly in the starting term, without relying on base-specific periodicity computations (here, $\varphi=\frac{1+\sqrt{5}}{2}$). Our approach extends to certain Lucas sequences.Open AccessUniform Bounds for Digit-Appending Fibonacci Walks
Building on the work of Miller et al. [Fibonacci Quarterly, 2022], we show that it is impossible to "walk to infinity" along the Fibonacci sequence in any integer base $b\geq 2$ when at most $N$ digits are appended per step. Our proof method is base-independent, yielding the bound \[L \;\leq\; 2N\log_\varphi b \,+\, O(1),\] uniformly in the starting term, without relying on base-specific periodicity computations (here, $\varphi=\frac{1+\sqrt{5}}{2}$). Our approach extends to certain Lucas sequences. - Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 99-100
Optimal Membership Design
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 99-100
Open AccessOptimal Membership Design
- Open Access
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 784
Shill-Proof Auctions
- 2 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 784
Open AccessShill-Proof Auctions
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3451-3465
NFTs as a Data-Rich Test Bed: Conspicuous Consumption and its Determinants
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3451-3465
Open AccessNFTs as a Data-Rich Test Bed: Conspicuous Consumption and its Determinants
- Open Access
Incentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure
We introduce the first formal model capturing the elicitation of unverifiable information from a party (the "source") with implicit signals derived by other players (the "observers"). Our model is motivated in part by applications in decentralized physical infrastructure networks (a.k.a. "DePIN"), an emerging application domain in which physical services (e.g., sensor information, bandwidth, or energy) are provided at least in part by untrusted and self-interested parties. A key challenge in these signal network applications is verifying the level of service that was actually provided by network participants. We first establish a condition called source identifiability, which we show is necessary for the existence of a mechanism for which truthful signal reporting is a strict equilibrium. For a converse, we build on techniques from peer prediction to show that in every signal network that satisfies the source identifiability condition, there is in fact a strictly truthful mechanism, where truthful signal reporting gives strictly higher total expected payoff than any less informative equilibrium. We furthermore show that this truthful equilibrium is in fact the unique equilibrium of the mechanism if there is positive probability that any one observer is unconditionally honest (e.g., if an observer were run by the network owner). Also, by extending our condition to coalitions, we show that there are generally no collusion-resistant mechanisms in the settings that we consider. We apply our framework and results to two DePIN applications: proving location, and proving bandwidth. In the location-proving setting observers learn (potentially enlarged) Euclidean distances to the source. Here, our condition has an appealing geometric interpretation, implying that the source's location can be truthfully elicited if and only if it is guaranteed to lie inside the convex hull of the observers.
Open AccessIncentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure
We introduce the first formal model capturing the elicitation of unverifiable information from a party (the "source") with implicit signals derived by other players (the "observers"). Our model is motivated in part by applications in decentralized physical infrastructure networks (a.k.a. "DePIN"), an emerging application domain in which physical services (e.g., sensor information, bandwidth, or energy) are provided at least in part by untrusted and self-interested parties. A key challenge in these signal network applications is verifying the level of service that was actually provided by network participants. We first establish a condition called source identifiability, which we show is necessary for the existence of a mechanism for which truthful signal reporting is a strict equilibrium. For a converse, we build on techniques from peer prediction to show that in every signal network that satisfies the source identifiability condition, there is in fact a strictly truthful mechanism, where truthful signal reporting gives strictly higher total expected payoff than any less informative equilibrium. We furthermore show that this truthful equilibrium is in fact the unique equilibrium of the mechanism if there is positive probability that any one observer is unconditionally honest (e.g., if an observer were run by the network owner). Also, by extending our condition to coalitions, we show that there are generally no collusion-resistant mechanisms in the settings that we consider. We apply our framework and results to two DePIN applications: proving location, and proving bandwidth. In the location-proving setting observers learn (potentially enlarged) Euclidean distances to the source. Here, our condition has an appealing geometric interpretation, implying that the source's location can be truthfully elicited if and only if it is guaranteed to lie inside the convex hull of the observers.
- 15 December 2024
- Published by The Society for the Promotion of Mechanism and Institution Design in Journal of Mechanism and Institution Design
- Vol. 9 (1) , 83-104
Respect for Improvements and Comparative Statics in Matching Markets
One of the oldest results in the theory of two-sided matching is the entry comparative static, which shows that under the Gale-Shapley deferred acceptance algorithm, adding a new agent to one side of the market makes all the agents on the other side weakly better off. Here, we give a new proof of the entry comparative static, by way of a well-known property of deferred acceptance called respect for improvements. Our argument extends to yield comparative static results in more general settings, such as matching with slot-specific preferences.
- 15 December 2024
- Published by The Society for the Promotion of Mechanism and Institution Design in Journal of Mechanism and Institution Design
- Vol. 9 (1) , 83-104
Respect for Improvements and Comparative Statics in Matching Markets
One of the oldest results in the theory of two-sided matching is the entry comparative static, which shows that under the Gale-Shapley deferred acceptance algorithm, adding a new agent to one side of the market makes all the agents on the other side weakly better off. Here, we give a new proof of the entry comparative static, by way of a well-known property of deferred acceptance called respect for improvements. Our argument extends to yield comparative static results in more general settings, such as matching with slot-specific preferences.