Searcharxiv⌕ Search

arXiv subjects

Konstantinos E. Zachariadis

Publications and source records attributed to Konstantinos E. Zachariadis.

2 recordsLinked to original sources

Large-Market Discipline in Combinatorial Double Auctions: No Assembly, Bundle Selection, and Complementarities

We study double auctions for markets in which goods are valuable in bundles, such as data, model weights, and fine-tuned AI assets. A key friction in such markets is No Assembly: a platform may be unable, for legal or technical reasons, to combine components supplied by different sellers into a single bundle. We formulate a combinatorial buyer's-bid double auction under this constraint. Under explicit stability and price-influence conditions (maintained in general, and for two goods derived from local price-taking and a feedback bound), each bundle submarket inherits the large-market discipline of single-good double auctions: bid shading vanishes, and clearing prices concentrate on competitive levels and track the common value (price discovery). The key incentive step, that bidding on a bundle creates no first-order strategic distortion beyond the single-good logic, is proved for two goods; for larger item sets it remains a maintained condition. Multi-agent reinforcement-learning simulations decompose the welfare loss and indicate that No Assembly, not strategic shading, is the binding finite-market friction, with both losses small in moderately thick markets and declining with complementarity amongst goods.

econ.GN↗

FAIR-Compute: A Roadmap for Fair and Efficient Allocation of Federated Digital Research Infrastructure

As demand for high-performance computing (HPC), high-throughput computing and data storage grows, the way scarce compute is allocated -- not just how much exists -- has become a decisive factor in the productivity of UK research. FAIR-Compute studies allocation in a federated Digital Research Infrastructure (DRI) as a problem at the intersection of algorithmic game theory, transport economics and HPC scheduling. Our central observation is simple: once a shared system must decide who runs, when and under what evidence, its scheduler settings cease to be a purely technical matter and become policy. The project combined three strands of evidence: a landscape review of UK and international allocation practice (including EuroHPC, WLCG, ACCESS, JASMIN and DiRAC) supported by a stakeholder survey; a mechanism-design model of allocation under strategic and uncertain user reports; and a simulation study built on the public Fresco/Anvil workload trace and controlled synthetic stress tests. Three results recur across all three strands. First, allocation records measure occupancy (resources reserved) rather than utilisation (useful work done), so the system cannot currently answer the question UKRI and DSIT most want answered -- whether resources deliver productive value. Second, simple, transparent scheduling heuristics perform close to an offline full-information benchmark once tuned, so the near-term opportunity is to tune and instrument existing schedulers rather than replace them. Third, federation is genuinely valuable but behaves like uncoordinated routing when left unmanaged: it can minimise average delay while quietly concentrating load -- and potentially harm -- on the receiving system. This mirrors a classic effect from road-traffic economics (Braess's paradox), where letting everyone independently pick the fastest route can leave the whole network worse off.

cs.DC↗