[PDF][PDF] Greedy transaction fee mechanisms for (non-) myopic miners

Y Gafni, A Yaish - arXiv preprint arXiv:2210.07793, 2022 - researchgate.net
Cryptocurrencies such as Bitcoin [66] and Ethereum [10] facilitate money transactions
between users by relying on a decentralized process in which miners collect such …

Learning-augmented online packet scheduling with deadlines

YC Liang, C Stein, HT Wei - arXiv preprint arXiv:2305.07164, 2023 - arxiv.org
The modern network aims to prioritize critical traffic over non-critical traffic and effectively
manage traffic flow. This necessitates proper buffer management to prevent the loss of …

Deterministic Scheduling and Reliable Routing for Smart Ocean Services in Maritime Internet of Things: A Cross-Layer Approach

C Wang, Y Peng, J Wu, L Liu, S Mumtaz… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
The Maritime Internet of Things (MIoT) provides intelligent information services for marine
scientific research, emergency response and environmental monitoring by leveraging its …

[HTML][HTML] Online packet scheduling with bounded delay and lookahead

M Böhm, M Chrobak, Ł Jeż, F Li, J Sgall… - Theoretical Computer …, 2019 - Elsevier
We study the online bounded-delay packet scheduling problem (PacketScheduling), where
packets of unit size arrive at a router over time and need to be transmitted over a network …

Packet scheduling: Plans, monotonicity, and the golden ratio

P Veselý - ACM SIGACT News, 2021 - dl.acm.org
Online packet scheduling with deadlines is one of the fundamental models in buffer
management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) …

Competitive Revenue Extraction from Time-Discounted Transactions in the Semi-Myopic Regime

Y Gafni, A Yaish - arXiv preprint arXiv:2402.08549, 2024 - arxiv.org
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 …

SIGACT news online algorithms column 35: 2019 in review

F Höhne, S Schmitt, R van Stee - ACM SIGACT News, 2019 - dl.acm.org
In this column, we will discuss some papers in online algorithms that appeared in 2019. As
usual, we make no claim at complete coverage here, and have instead made a selection. If …

Breaking the barrier of 2 for the competitiveness of Longest Queue Drop

A Antoniadis, M Englert, N Matsakis… - ACM Transactions on …, 2024 - dl.acm.org
We consider the problem of managing the buffer of a shared-memory switch that transmits
packets of unit value. A shared-memory switch consists of an input port, a number of output …

An optimal algorithm for 2-bounded delay buffer management with lookahead

KM Kobayashi - Theoretical Computer Science, 2021 - Elsevier
The bounded delay buffer management problem, which was proposed by Kesselman et
al.(STOC 2001 and SIAM Journal on Computing 33 (3), 2004), is an online problem focusing …

Randomized two-valued bounded delay online buffer management

C Dürr, S Kamali - Operations Research Letters, 2021 - Elsevier
In the bounded delay buffer management problem unit size packets arrive online to be sent
over a network link. The objective is to maximize the total weight of packets sent before their …