Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Gafni, Yotam"'
Autor:
Gafni, Yotam, Golan, Ben
Perpetual voting studies fair collective decision-making in settings where many decisions are to be made, and is a natural framework for settings such as parliaments and the running of blockchain Decentralized Autonomous Organizations (DAOs). We focu
Externí odkaz:
http://arxiv.org/abs/2408.08767
Two firms are engaged in a competitive prediction task. Each firm has two sources of data -- labeled historical data and unlabeled inference-time data -- and uses the former to derive a prediction model, and the latter to make predictions on new inst
Externí odkaz:
http://arxiv.org/abs/2403.17515
Autor:
Gafni, Yotam, Yaish, Aviv
To allocate transactions to blocks, cryptocurrencies use an auction-like transaction fee mechanism (TFM). A conjecture of Roughgarden [44] asks whether there is a TFM that is incentive compatible for both the users and the miner, and is also resistan
Externí odkaz:
http://arxiv.org/abs/2402.08564
Autor:
Gafni, Yotam, Yaish, Aviv
Decentralized cryptocurrencies are payment systems that rely on aligning the incentives of users and miners to operate correctly and offer a high quality of service to users. Recent literature studies the mechanism design problem of the auction servi
Externí odkaz:
http://arxiv.org/abs/2402.08549
Autor:
Gafni, Yotam, Tennenholtz, Moshe
Publikováno v:
EPTCS 379, 2023, pp. 245-259
In robust decision making under uncertainty, a natural choice is to go with safety (aka security) level strategies. However, in many important cases, most notably auctions, there is a large multitude of safety level strategies, thus making the choice
Externí odkaz:
http://arxiv.org/abs/2210.15181
Autor:
Gafni, Yotam, Yaish, Aviv
Cryptocurrencies employ auction-esque transaction fee mechanisms (TFMs) to allocate transactions to blocks, and to determine how much fees miners can collect from transactions. Several impossibility results show that TFMs that satisfy a standard set
Externí odkaz:
http://arxiv.org/abs/2210.07793
Autor:
Gafni, Yotam, Tennenholtz, Moshe
The quality of learning generally improves with the scale and diversity of data. Companies and institutions can therefore benefit from building models over shared data. Many cloud and blockchain platforms, as well as government initiatives, are inter
Externí odkaz:
http://arxiv.org/abs/2201.09137
Autor:
Gafni, Yotam
For finite integer squares, we consider the problem of learning a classification $I$ that respects Pareto domination. The setup is natural in dynamic programming settings. We show that a generalization of the binary search algorithm achieves an optim
Externí odkaz:
http://arxiv.org/abs/2111.06101
We consider fair allocation of indivisible items in a model with goods, chores, and copies, as a unified framework for studying: (1)~the existence of EFX and other solution concepts for goods with copies; (2)~the existence of EFX and other solution c
Externí odkaz:
http://arxiv.org/abs/2109.08671
Weighted voting games apply to a wide variety of multi-agent settings. They enable the formalization of power indices which quantify the coalitional power of players. We take a novel approach to the study of the power of big vs.~small players in thes
Externí odkaz:
http://arxiv.org/abs/2108.09216