<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>IMDEA Networks</title>
<link>https://hdl.handle.net/20.500.12761/1</link>
<description/>
<pubDate>Fri, 09 Oct 2026 17:42:43 GMT</pubDate>
<dc:date>2026-10-09T17:42:43Z</dc:date>
<item>
<title>Actionable Signals in Prediction Markets: Evaluating Public and Private Information through Systematic Trading</title>
<link>https://hdl.handle.net/20.500.12761/2105</link>
<description>Actionable Signals in Prediction Markets: Evaluating Public and Private Information through Systematic Trading
Saguillo, Oriol; Giacomelli, Fabio; Kiffer, Lucianna
Prediction markets aggregate the private beliefs of many participants into publicly observable probability estimates. Beyond prices alone, the trading behavior they generate may reveal public and&#13;
private signals that are actionable for automated trading agents. We study whether these observable market signals reliably identify profitable trading opportunities. Specifically, we evaluate two&#13;
complementary classes of trading signals: Risk Arbitrage, which exploits periods where publicly available information has effectively determined an outcome before prices fully converge, and Information Asymmetry, which exploits large positions accumulated while market prices still reflect substantial uncertainty.&#13;
Using the complete history of matched trades from Polymarket, spanning 26,964 markets between January 2024 and January 2026, we evaluate the reliability of these two classes of signals. We find that they exhibit markedly different levels of reliability. Risk Arbitrage identifies substantial opportunities around effective resolution but suffers significant losses from false positives, yielding a net loss of $23.4M despite $15.3M in gross profit. Information Asymmetry is considerably more concentrated, generating $139.3M in gross&#13;
profit but only $7.8M net, with activity overwhelmingly driven by the 2024 U.S. presidential election. Across both regimes, profits concentrate among a small number of accounts, while position size&#13;
reflects capital commitment more strongly than predictive skill.
</description>
<pubDate>Sun, 01 Nov 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12761/2105</guid>
<dc:date>2026-11-01T00:00:00Z</dc:date>
</item>
<item>
<title>New QUBO Transformations to Improve Quantum and Simulated Annealing Performance for Quadratic Knapsack</title>
<link>https://hdl.handle.net/20.500.12761/2104</link>
<description>New QUBO Transformations to Improve Quantum and Simulated Annealing Performance for Quadratic Knapsack
Borrajo Carro, Nicolás; Ramirez Rondon, Juan Marcos; Nosrati, Farzam; Aguilar, Jose; Mancuso, Vincenzo; Fernández Anta, Antonio
Recent advancements in quantum computing have demonstrated significant potential for solving combinatorial&#13;
optimization problems, like the quadratic knapsack problem, a constrained binary optimization problem. How-&#13;
ever, current quantum and quantum-inspired algorithms often require transforming these constrained problems&#13;
into an unconstrained form, known as Quadratic Unconstrained Binary Optimization (QUBO). Such transfor-&#13;
mations can significantly impact the algorithms’ speed and efficiency. In this study, we evaluate five existing&#13;
transformation methods and propose four novel approaches. We assess all nine methods using Simulated An-&#13;
nealing and find that three of our approaches outperform existing methods in terms of execution time and the&#13;
quality and quantity of feasible solutions found. Additionally, we tested these transformations on quantum&#13;
annealers, which were unable to solve even small problem instances, due to limitations in connectivity and&#13;
error rates. However, our results highlight the advantages of the new approaches, which reduce the total num-&#13;
ber of variables in the QUBO representation. This is a critical factor for enhanced performance on emerging&#13;
quantum hardware, since it also reduces the required number of qubits and the embedding chain lengths.
</description>
<pubDate>Sun, 01 Mar 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12761/2104</guid>
<dc:date>2026-03-01T00:00:00Z</dc:date>
</item>
<item>
<title>Columnar Packet Traces for Scalable Encrypted-Internet Measurement</title>
<link>https://hdl.handle.net/20.500.12761/2103</link>
<description>Columnar Packet Traces for Scalable Encrypted-Internet Measurement
Rojo, Pablo; Ramirez Rondon, Juan Marcos; Mancuso, Vincenzo; Fernández Anta, Antonio
Internet traffic volumes continue to grow while&#13;
transport and application encryption increasingly limit payload&#13;
visibility. However, modern transport protocols such as QUIC&#13;
complicate traditional packet-trace analytics built around pcap&#13;
(e.g., tshark-to-CSV), and row-oriented extraction increases the&#13;
cost of repeated analysis. This paper makes repeated offline mea-&#13;
surement practical by converting packet traces into a column-&#13;
oriented representation that separates one-time parsing from&#13;
downstream analytics. Concretely, we introduce an advanced&#13;
benchmarked software implementation that converts pcap files&#13;
to the column-oriented Apache parquet format. To the best of&#13;
our knowledge, this is among the first end-to-end pipelines that&#13;
(i) converts pcap/pcapng traces into parquet with a schema&#13;
aimed at repeated offline measurement and (ii) is engineered&#13;
around a convert-once, query-many workflow with measured&#13;
end-to-end time-to-insight benefits. The pipeline leverages par-&#13;
allel parsing to produce a columnar dataset that can be queried&#13;
efficiently by standard analytics engines. We benchmark end-&#13;
to-end time-to-insight and storage costs across representative&#13;
workloads and diverse datasets. Our results show that after a&#13;
one-time conversion, subsequent analyses can exploit column&#13;
pruning and vectorized scans to reduce query time compared&#13;
with re-parsing pcap or re-extracting row-oriented text formats,&#13;
while maintaining storage costs competitive with compressed&#13;
pcap and CSV baselines.
</description>
<pubDate>Mon, 01 Jun 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12761/2103</guid>
<dc:date>2026-06-01T00:00:00Z</dc:date>
</item>
<item>
<title>Live Streaming of Sport Events: Pricing, Quality, and Side Payments</title>
<link>https://hdl.handle.net/20.500.12761/2102</link>
<description>Live Streaming of Sport Events: Pricing, Quality, and Side Payments
Sereno, Matteo; Castagno, Paolo; Mancuso, Vincenzo; Ajmone Marsan, Marco
The commercial success of live stream-&#13;
ing—especially for major sports events—is putting increasing&#13;
pressure on Internet Service Providers (ISPs) and raises&#13;
questions about pricing, service quality, and network neutrality.&#13;
A key open problem is understanding how congestion, pricing,&#13;
and side payments affect user choices and market outcomes.&#13;
This paper introduces a modeling framework to study in-&#13;
teractions among users, ISPs, and content providers (CPs)&#13;
in congestion-sensitive environments. The framework combines&#13;
quality-of-experience modeling, discrete choice theory, and evo-&#13;
lutionary population dynamics, with particular attention to side&#13;
payments from CPs to ISPs and their impact on user allocation&#13;
and revenues.&#13;
Using this framework, we analyze how side payments may&#13;
affect ISP market shares and give rise to potential neutrality and&#13;
fairness concerns. Results show that side payments can benefit&#13;
both CPs and ISPs, but that their allocation among ISPs plays&#13;
a critical role in limiting induced market distortions.
</description>
<pubDate>Fri, 01 May 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">https://hdl.handle.net/20.500.12761/2102</guid>
<dc:date>2026-05-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
