pith. sign in

arxiv: 2607.00175 · v1 · pith:JPYWUHGXnew · submitted 2026-06-30 · 💻 cs.GT

Knowing Who, Not How Much: Learning-Augmented Mechanisms for Consumer Utility Maximization

Kira Goldner , Divyarthi Mohan , Thodoris Tsilivis This is my paper

Pith reviewed 2026-07-02 16:52 UTC · model grok-4.3

classification 💻 cs.GT
keywords learning-augmented mechanism designutility maximizationonline mechanismstruthful mechanismsrandom-order arrivalconsistencyrobustness
0
0 comments X

The pith

Predicting only the identity of the highest-valued agent yields constant-approximation truthful mechanisms for online utility maximization.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies consumer utility maximization where strategic agents arrive sequentially in random order. Common predictions of values or optimal welfare fail here because payments work against the objective of maximizing reported utilities. Predicting the identity of the highest-valued agent instead suffices to build a mechanism that, when correct, approximates the full-information optimum by a constant factor and, when wrong, still approximates the best possible implementable solution by a constant factor. The construction begins with a deterministic truthful mechanism obtained by adapting offline randomized techniques to the online setting, then augments it with the identity prediction.

Core claim

A deterministic truthful mechanism for online random-order utility maximization, when augmented with a prediction of the highest-valued agent's identity, achieves a constant approximation to the optimal full-information solution under correct predictions and a constant approximation to the best implementable solution under arbitrary prediction errors.

What carries the argument

A deterministic truthful mechanism augmented with the predicted identity of the highest-valued agent to guide online allocation decisions.

If this is right

  • Correct identity predictions yield constant approximation to the full-information optimum.
  • Arbitrarily incorrect identity predictions still yield constant approximation to the best implementable solution.
  • The base mechanism is deterministic and truthful without any predictions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same identity-based prediction might suffice in other settings where payments conflict with the design objective.
  • The approach could be tested by simulating the mechanism on synthetic instances with controlled top-agent prediction errors.
  • Extending the model beyond random order to adversarial arrival would require checking whether the same prediction still suffices.

Load-bearing premise

Adapting offline randomized techniques produces a deterministic truthful mechanism that works in the online random-order arrival model.

What would settle it

An instance family in the random-order model where the mechanism with correct identity predictions achieves only an unbounded approximation ratio to the full-information optimum.

Figures

Figures reproduced from arXiv: 2607.00175 by Divyarthi Mohan, Kira Goldner, Thodoris Tsilivis.

Figure 1
Figure 1. Figure 1: Expected utility of a v5-lottery. Consider now any p-lottery on Nlot posting a price of vk+1. Notice that since we have assumed event Elot = ERO ∩ {1 ∈ Nlot, 2 ∈ Nsample} occurs, we have for i ≥ 2 that both ni , n¯i are in [ i 6 , 5i 6 ], or equivalently, ni ∈ [ n¯i 5 , 5¯ni ] (and ¯n1 = 0 and n1 = n2 = ¯n2 = 1). We lower bound the expected utility of posting vk+1 on Nlot: U(Nlot, vk+1) = 1 nk X k i=1 ni(v… view at source ↗
read the original abstract

We study consumer utility maximization in an online random-order model where strategic agents arrive sequentially. To circumvent strong impossibility results for utility maximization, we turn to the framework of learning-augmented mechanism design. Crucially, we show that the types of predictions commonly used in learning-augmented mechanism design (such as predictions of agent values or the optimal value) are not useful for utility maximization, where payments are directly at odds with the objective. Instead, we identify that a qualitatively different kind of prediction suffices: the identity of the highest-valued agent. First, we provide a deterministic truthful mechanism for our online setting by adapting offline randomized techniques. Then, we augment our mechanism with predictions. When the predictions are correct, we achieve a constant approximation to the optimal solution under full information (consistency), and even when predictions are arbitrarily bad, we guarantee a constant approximation to the best implementable solution (robustness).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper studies consumer utility maximization in an online random-order arrival model with strategic agents. It argues that standard value or welfare predictions are unhelpful due to the conflict between payments and the objective, but that predicting the identity of the highest-valued agent suffices. It constructs a deterministic truthful mechanism by adapting offline randomized techniques for utility maximization, then augments it to obtain constant-factor consistency (when the prediction is correct) and robustness (constant-factor approximation to the best implementable solution even under arbitrary prediction error).

Significance. If the central adaptation preserves ex-post truthfulness and the stated approximation factors, the result would be significant: it identifies a qualitatively weaker prediction that is useful precisely where stronger predictions fail, and supplies the first learning-augmented guarantees for this objective in the online setting. The work also supplies an explicit deterministic truthful mechanism, which is a non-trivial technical contribution given known impossibilities for utility maximization.

major comments (2)
  1. [Abstract / mechanism construction] Abstract (first contribution) and the mechanism-construction section: the claim that a deterministic truthful mechanism is obtained by adapting offline randomized techniques for consumer utility maximization is load-bearing for both consistency and robustness, yet the manuscript provides no explicit verification that ex-post truthfulness or the constant approximation is preserved when the mechanism is made deterministic and executed in random order. Offline randomized mechanisms typically rely on lotteries to balance payments against utility; the conversion risks violating the guarantees without additional arguments.
  2. [Abstract] Robustness claim (abstract): the guarantee is stated as a constant approximation to "the best implementable solution," but no comparison or reduction is given showing that this quantity is within a constant of the offline optimum or that the online mechanism achieves it without additional assumptions on the arrival order.
minor comments (1)
  1. [Abstract] The abstract states results at a high level but contains no proof sketches, constants, or equation references; adding a one-paragraph technical outline would improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

Thank you for the careful review and the recommendation for major revision. We address the two major comments point by point below, indicating where we will strengthen the exposition or add explicit arguments in the revision.

read point-by-point responses

  1. Referee: [Abstract / mechanism construction] Abstract (first contribution) and the mechanism-construction section: the claim that a deterministic truthful mechanism is obtained by adapting offline randomized techniques for consumer utility maximization is load-bearing for both consistency and robustness, yet the manuscript provides no explicit verification that ex-post truthfulness or the constant approximation is preserved when the mechanism is made deterministic and executed in random order. Offline randomized mechanisms typically rely on lotteries to balance payments against utility; the conversion risks violating the guarantees without additional arguments.

    Authors: We appreciate the referee's identification of this potential gap in explicitness. The main text sketches the adaptation of the offline randomized mechanism (based on lottery-based balancing of payments and utility) to a deterministic online mechanism, but we agree that a self-contained verification is needed to confirm preservation of ex-post truthfulness and the constant approximation factor under random-order execution. In the revised manuscript we will insert a dedicated lemma (with proof) showing that the deterministic payment rule remains dominant-strategy incentive compatible without randomization and that the approximation guarantee holds in expectation over the random arrival order. This will be placed immediately after the mechanism description. revision: yes

  2. Referee: [Abstract] Robustness claim (abstract): the guarantee is stated as a constant approximation to "the best implementable solution," but no comparison or reduction is given showing that this quantity is within a constant of the offline optimum or that the online mechanism achieves it without additional assumptions on the arrival order.

    Authors: The robustness guarantee is deliberately stated with respect to the best implementable solution, which is the appropriate benchmark given the known impossibility results for approximating the offline optimum under utility maximization. The paper formally defines this benchmark and proves that the augmented mechanism achieves a constant-factor approximation to it in the standard random-order model; the analysis does not rely on any assumptions beyond random order. We will revise the abstract and the robustness paragraph in Section 1 to explicitly state this distinction and to reference the impossibility results that motivate the benchmark choice. revision: partial

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The abstract describes a mechanism construction that adapts offline randomized techniques to obtain a deterministic truthful online mechanism, then augments it with a prediction of the highest-valued agent's identity to achieve consistency and robustness guarantees. No equations, fitted parameters, or self-citations are quoted that would reduce these guarantees to inputs by construction. The claims rest on the explicit mechanism design rather than tautological redefinitions or load-bearing self-references, making the derivation self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard domain assumptions of the online random-order model and strategic behavior; no free parameters or invented entities are mentioned in the abstract.

axioms (2)
  • domain assumption Agents arrive sequentially in random order and act strategically
    Core model stated in the first sentence of the abstract.
  • domain assumption Strong impossibility results exist for utility maximization without predictions
    Invoked to motivate the learning-augmented approach.

pith-pipeline@v0.9.1-grok · 5691 in / 1224 out tokens · 23794 ms · 2026-07-02T16:52:11.237849+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

201 extracted references · 46 canonical work pages · 2 internal anchors

  1. [1]

    2018 , publisher=

    Abebe, Rediet and Goldner, Kira , journal=. 2018 , publisher=

    2018

  2. [2]

    Abraham, Ittai and Babaioff, Moshe and Dughmi, Shaddin and Roughgarden, Tim , Booktitle =

  3. [3]

    1991 , url =

    Aharoni, Ron , journal =. 1991 , url =

    1991

  4. [4]

    , booktitle=

    Alaei, S. , booktitle=. 2011 , pages=. doi:10.1109/FOCS.2011.90 , ISSN=

    work page doi:10.1109/focs.2011.90 2011

  5. [5]

    1953 , publisher=

    Allais, Maurice , journal=. 1953 , publisher=

    1953

  6. [6]

    2021 , organization=

    Amer, Ameer and Talgam-Cohen, Inbal , booktitle=. 2021 , organization=

    2021

  7. [7]

    Anderson, Edward J and Nash, Peter , year=

  8. [8]

    Discrete Optimization , volume =

    Antonios Antoniadis and Themis Gouleakis and Pieter Kleer and Pavel Kolev , keywords =. Discrete Optimization , volume =. 2023 , issn =. doi:https://doi.org/10.1016/j.disopt.2023.100778 , url =

    work page doi:10.1016/j.disopt.2023.100778 2023

  9. [9]

    Econometrica , keywords =

    Armstrong, Mark , doi =. Econometrica , keywords =

  10. [10]

    Ausubel, Lawrence M and others , journal=

  11. [11]

    Ausubel, Lawrence M , journal=

  12. [12]

    Matthew , Booktitle =

    Azar, Pablo and Daskalakis, Constantinos and Micali, Silvio and Weinberg, S. Matthew , Booktitle =

  13. [13]

    2022 , isbn =

    Agrawal, Priyank and Balkanski, Eric and Gkatzelis, Vasilis and Ou, Tingting and Tan, Xizhi , title =. 2022 , isbn =. doi:10.1145/3490486.3538306 , booktitle =

    work page doi:10.1145/3490486.3538306 2022

  14. [14]

    Gonczarowski , editor =

    Moshe Babaioff and Kira Goldner and Yannai A. Gonczarowski , editor =. Proceedings of the 2020. 2020 , url =. doi:10.1137/1.9781611975994.150 , timestamp =

    work page doi:10.1137/1.9781611975994.150 2020

  15. [15]

    2024 , organization=

    Gonczarowski, Yannai A and Immorlica, Nicole and Li, Yingkai and Lucier, Brendan , booktitle=. 2024 , organization=

    2024

  16. [16]

    and Nisan, Noam , title =

    Babaioff, Moshe and Gonczarowski, Yannai A. and Nisan, Noam , title =. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , series =. 2017 , isbn =. doi:10.1145/3055399.3055426 , acmid =

    work page doi:10.1145/3055399.3055426 2017

  17. [17]

    Matthew , Booktitle =

    Babaioff, Moshe and Immorlica, Nicole and Lucier, Brendan and Weinberg, S. Matthew , Booktitle =

  18. [18]

    Balkanski, Eric and Gkatzelis, Vasilis and Tan, Xizhi and Zhu, Cherlin , booktitle=

  19. [19]

    1997 , publisher=

    Banerjee, Abhijit V , journal=. 1997 , publisher=

    1997

  20. [20]

    American Economic Review , month =

    Bergemann, Dirk and Brooks, Benjamin and Morris, Stephen , doi =. American Economic Review , month =

  21. [21]

    Birmpas, Georgios and Ezra, Tomer and Leonardi, Stefano and Russo, Matteo , journal=

  22. [22]

    2016 , publisher=

    Braverman, Mark and Chen, Jing and Kannan, Sampath , journal=. 2016 , publisher=

    2016

  23. [23]

    Matthew , journal=

    Briest, Patrick and Chawla, Shuchi and Kleinberg, Robert and Weinberg, S. Matthew , journal=. 2015 , publisher=

    2015

  24. [24]

    Proceedings of the 2017

    Johannes Brustle and Yang Cai and Fa Wu and Mingfei Zhao , Bibsource =. Proceedings of the 2017. 2017 , Bdsk-Url-1 =. doi:10.1145/3033274.3085148 , Pages =

    work page doi:10.1145/3033274.3085148 2017

  25. [25]

    1989 , publisher=

    Bulow, Jeremy and Roberts, John , journal=. 1989 , publisher=

    1989

  26. [26]

    , booktitle=

    Yang Cai and Daskalakis, C. , booktitle=. 2011 , pages=. doi:10.1109/FOCS.2011.76 , ISSN=

    work page doi:10.1109/focs.2011.76 2011

  27. [27]

    Matthew , title =

    Cai, Yang and Daskalakis, Constantinos and Weinberg, S. Matthew , title =. SIGecom Exch. , issue_date =. 2011 , issn =. doi:10.1145/1998549.1998555 , acmid =

    work page doi:10.1145/1998549.1998555 2011

  28. [28]

    Matthew Weinberg , booktitle =

    Yang Cai and Constantinos Daskalakis and S. Matthew Weinberg , booktitle =. 2012 , crossref =. doi:10.1109/FOCS.2012.88 , timestamp =

    work page doi:10.1109/focs.2012.88 2012

  29. [29]

    Matthew Weinberg , title =

    Yang Cai and Constantinos Daskalakis and S. Matthew Weinberg , title =. CoRR , volume =. 2013 , url =

    2013

  30. [30]

    Matthew , title =

    Cai, Yang and Daskalakis, Constantinos and Weinberg, S. Matthew , title =. Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms , series =. 2013 , isbn =

    2013

  31. [31]

    and Goldner, Kira and McAfee, R

    Cai, Yang and Devanur, Nikhil R. and Goldner, Kira and McAfee, R. Preston , title =. Proceedings of the 2019 ACM Conference on Economics and Computation , series =. 2019 , isbn =. doi:10.1145/3328526.3329562 , publisher =

    work page doi:10.1145/3328526.3329562 2019

  32. [32]

    and Weinberg, S

    Cai, Yang and Devanur, Nikhil R. and Weinberg, S. Matthew , title =. Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing , series =. 2016 , isbn =. doi:10.1145/2897518.2897645 , acmid =

    work page doi:10.1145/2897518.2897645 2016

  33. [33]

    2013 , url =

    Cai, Yang and Huang, Zhiyi , booktitle =. 2013 , url =

    2013

  34. [34]

    Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , series =

    Cai, Yang and Zhao, Mingfei , title =. Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , series =. 2017 , isbn =. doi:10.1145/3055399.3055465 , acmid =

    work page doi:10.1145/3055399.3055465 2017

  35. [35]

    2019 , isbn =

    Cai, Yang and Zhao, Mingfei , title =. 2019 , isbn =. doi:10.1145/3328526.3329616 , booktitle =

    work page doi:10.1145/3328526.3329616 2019

  36. [36]

    2007.07990 , archivePrefix=

    Shuchi Chawla and Nikhil Devanur and Thodoris Lykouris , year=. 2007.07990 , archivePrefix=

    work page arXiv 2007

  37. [37]

    Proceedings of the Fifteenth ACM Conference on Economics and Computation , year =

    Chawla, Shuchi and Fu, Hu and Karlin, Anna , title =. Proceedings of the Fifteenth ACM Conference on Economics and Computation , year =

  38. [38]

    and Miller, J

    Chawla, Shuchi and Goldner, Kira and Karlin, Anna R. and Miller, J. Benjamin , title =. Proceedings of the 17th International Symposium on Algorithmic Game Theory (SAGT) , editor="Sch

  39. [39]

    Benjamin and Pountourakis, Emmanouil , title =

    Chawla, Shuchi and Goldner, Kira and Miller, J. Benjamin and Pountourakis, Emmanouil , title =. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =. 2018 , isbn =

    2018

  40. [40]

    2021 , organization=

    Cai, Yang and Goldner, Kira and Ma, Steven and Zhao, Mingfei , booktitle=. 2021 , organization=

    2021

  41. [41]

    and Kleinberg, Robert , booktitle =

    Chawla, Shuchi and Hartline, Jason D. and Kleinberg, Robert , booktitle =. 2007 , url =

    2007

  42. [42]

    Chawla, Shuchi and Hartline, Jason D and Malec, David L and Sivan, Balasubramanian , Booktitle =

  43. [43]

    Games and Economic Behavior , volume =

    Shuchi Chawla and David Malec and Balasubramanian Sivan , keywords =. Games and Economic Behavior , volume =. 2015 , note =. doi:http://dx.doi.org/10.1016/j.geb.2012.08.010 , url =

    work page doi:10.1016/j.geb.2012.08.010 2015

  44. [44]

    Benjamin , Booktitle =

    Chawla, Shuchi and Miller, J. Benjamin , Booktitle =. 2016 , Bdsk-Url-1 =. doi:10.1145/2940716.2940756 , Isbn =

    work page doi:10.1145/2940716.2940756 2016

  45. [45]

    Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond , booktitle =

    Chawla, Shuchi and Rezvan, Rojin and Teng, Yifeng and Tzamos, Christos , title =. 2022 , isbn =. doi:10.1145/3519935.3520065 , booktitle =

    work page doi:10.1145/3519935.3520065 2022

  46. [46]

    2023 , organization=

    Chawla, Shuchi and Rezvan, Rojin and Teng, Yifeng and Tzamos, Christos , booktitle=. 2023 , organization=

    2023

  47. [47]

    SIGecom Exch

    Chawla, Shuchi and Sivan, Balasubramanian , title =. SIGecom Exch. , issue_date =. 2014 , issn =. doi:10.1145/2692375.2692378 , acmid =

    work page doi:10.1145/2692375.2692378 2014

  48. [48]

    2000 , volume =

    Che, Yeon-Koo and Gale, Ian , journal=. 2000 , volume =

    2000

  49. [49]

    Chen, Yiling and Eden, Alon and Wang, Juntao , journal=

  50. [50]

    1971 , publisher=

    Clarke, Edward H , journal=. 1971 , publisher=

    1971

  51. [51]

    2023 , organization=

    Cohen, Avi and Feldman, Michal and Mohan, Divyarthi and Talgam-Cohen, Inbal , booktitle=. 2023 , organization=

    2023

  52. [52]

    2015 , publisher=

    Collinson, Robert and Ellen, Ingrid Gould and Ludwig, Jens , booktitle=. 2015 , publisher=

    2015

  53. [53]

    Conitzer, Vincent and Sandholm, Tuomas and Santi, Paolo , booktitle=

  54. [54]

    2008 , publisher=

    Currie, Janet and Gahvari, Firouz , journal=. 2008 , publisher=

    2008

  55. [55]

    Caragiannis, Ioannis and Kalantzis, Georgios , booktitle=

  56. [56]

    2000 , publisher=

    Dasgupta, Partha and Maskin, Eric , journal=. 2000 , publisher=

    2000

  57. [57]

    2015 , publisher=

    Daskalakis, Constantinos , journal=. 2015 , publisher=

    2015

  58. [58]

    CoRR , pages =

    Daskalakis, Constantinos and Deckelbaum, Alan and Tzamos, Christos , booktitle =. CoRR , pages =. 2013 , url =

    2013

  59. [59]

    2013 , url =

    Daskalakis, Constantinos and Deckelbaum, Alan and Tzamos, Christos , booktitle =. 2013 , url =

    2013

  60. [60]

    2015 , organization=

    Daskalakis, Constantinos and Deckelbaum, Alan and Tzamos, Christos , booktitle=. 2015 , organization=

    2015

  61. [61]

    2017 , publisher=

    Daskalakis, Constantinos and Deckelbaum, Alan and Tzamos, Christos , journal=. 2017 , publisher=

    2017

  62. [62]

    2012 , url =

    Daskalakis, Constantinos and Weinberg, Seth Matthew , booktitle =. 2012 , url =

    2012

  63. [63]

    Devanur, Nikhil R and Goldner, Kira and Saxena, Raghuvansh R and Schvartzman, Ariel and Weinberg, S Matthew , booktitle=

  64. [64]

    and Haghpanah, Nima and Psomas, Christos-Alexandros , title =

    Devanur, Nikhil R. and Haghpanah, Nima and Psomas, Christos-Alexandros , title =. Proceedings of the 2017 ACM Conference on Economics and Computation , series =. 2017 , isbn =. doi:10.1145/3033274.3085122 , acmid =

    work page doi:10.1145/3033274.3085122 2017

  65. [65]

    Matthew , Booktitle =

    Devanur, Nikhil and Morgenstern, Jamie and Syrgkanis, Vasilis and Weinberg, S. Matthew , Booktitle =

  66. [66]

    and Weinberg, S

    Devanur, Nikhil R. and Weinberg, S. Matthew , title =. Proceedings of the 2017 ACM Conference on Economics and Computation , series =. 2017 , isbn =. doi:10.1145/3033274.3085132 , acmid =

    work page doi:10.1145/3033274.3085132 2017

  67. [67]

    Dhangwatnotai, Peerapong and Roughgarden, Tim and Yan, Qiqi , Journal =

  68. [68]

    14th Innovations in Theoretical Computer Science Conference,

    Shahar Dobzinski and Ariel Shaulker , editor =. 14th Innovations in Theoretical Computer Science Conference,. 2023 , url =. doi:10.4230/LIPICS.ITCS.2023.44 , timestamp =

    work page doi:10.4230/lipics.itcs.2023.44 2023

  69. [69]

    Paul D. 58th. 2017 , url =. doi:10.1109/FOCS.2017.56 , timestamp =

    work page doi:10.1109/focs.2017.56 2017

  70. [70]

    2020 , url =

    Paul D. 2020 , url =. doi:10.1137/20M1323850 , timestamp =

    work page doi:10.1137/20m1323850 2020

  71. [71]

    CoRR , volume =

    Paul D. CoRR , volume =. 2020 , url =

    2020

  72. [72]

    Dworczak, Piotr and others , year=

  73. [73]

    2021 , publisher=

    Dworczak, Piotr and Kominers, Scott Duke and Akbarpour, Mohammad , journal=. 2021 , publisher=

    2021

  74. [74]

    Proceedings of the 2018 ACM Conference on Economics and Computation , series =

    Eden, Alon and Feldman, Michal and Fiat, Amos and Goldner, Kira , title =. Proceedings of the 2018 ACM Conference on Economics and Computation , series =. 2018 , isbn =. doi:10.1145/3219166.3219173 , acmid =

    work page doi:10.1145/3219166.3219173 2018

  75. [75]

    , title =

    Eden, Alon and Feldman, Michal and Fiat, Amos and Goldner, Kira and Karlin, Anna R. , title =. Proceedings of the 2019 ACM Conference on Economics and Computation , series =. 2019 , isbn =. doi:10.1145/3328526.3329759 , publisher =

    work page doi:10.1145/3328526.3329759 2019

  76. [76]

    2024 , publisher=

    Eden, Alon and Feldman, Michal and Fiat, Amos and Goldner, Kira and Karlin, Anna R , journal=. 2024 , publisher=

    2024

  77. [77]

    2023 , organization=

    Eden, Alon and Feldman, Michal and Goldner, Kira and Mauras, Simon and Mohan, Divyarthi , booktitle=. 2023 , organization=

    2023

  78. [78]

    Eden, Alon and Goldner, Kira and Kerner, Eldar and Tsilivis, Thodoris , booktitle=

  79. [79]

    2022 , organization=

    Eden, Alon and Goldner, Kira and Zheng, Shuran , booktitle=. 2022 , organization=

    2022

  80. [80]

    Matthew , title =

    Eden, Alon and Feldman, Michal and Friedler, Ophir and Talgam-Cohen, Inbal and Weinberg, S. Matthew , title =. Proceedings of the 2017 ACM Conference on Economics and Computation , series =. 2017 , isbn =. doi:10.1145/3033274.3085115 , acmid =

    work page doi:10.1145/3033274.3085115 2017

Showing first 80 references.