English
Related papers

Related papers: Stackelberg Attacks on Auctions and Blockchain Tra…

200 papers

In Stackelberg security games when information about the attacker's payoffs is uncertain, algorithms have been proposed to learn the optimal defender commitment by interacting with the attacker and observing their best responses. In this…

Computer Science and Game Theory · Computer Science 2019-11-01 Jiarui Gan , Qingyu Guo , Long Tran-Thanh , Bo An , Michael Wooldridge

This paper presents a novel adversary model specifically tailored to distributed systems, aiming to assess the security of blockchain networks. Building upon concepts such as adversarial assumptions, goals, and capabilities, our proposed…

Cryptography and Security · Computer Science 2024-04-04 Erwan Mahe , Rouwaida Abdallah , Sara Tucci-Piergiovanni , Pierre-Yves Piriou

Recent results in the ML community have revealed that learning algorithms used to compute the optimal strategy for the leader to commit to in a Stackelberg game, are susceptible to manipulation by the follower. Such a learning algorithm…

Computer Science and Game Theory · Computer Science 2022-09-12 Georgios Birmpas , Jiarui Gan , Alexandros Hollender , Francisco J. Marmolejo-Cossío , Ninad Rajgopal , Alexandros A. Voudouris

Maximal extractable value (MEV) in which block proposers unethically gain profits by manipulating the order in which transactions are included within a block, is a key challenge facing blockchains such as Ethereum today. Left unchecked, MEV…

Cryptography and Security · Computer Science 2024-05-16 Yifan Mao , Mengya Zhang , Shaileshh Bojja Venkatakrishnan , Zhiqiang Lin

We propose a novel statistical learning method for multi-item auctions that incorporates credible intervals. Our approach employs nonparametric density estimation to estimate credible intervals for bidder types based on historical data. We…

Computer Science and Game Theory · Computer Science 2026-03-10 Jiale Han , Xiaowu Dai

We study the incentives behind double-spend attacks on Nakamoto-style Proof-of-Work cryptocurrencies. In these systems, miners are allowed to choose which transactions to reference with their block, and a common strategy for selecting…

Computer Science and Game Theory · Computer Science 2023-12-14 Yanni Georghiades , Rajesh Mishra , Karl Kreder , Sriram Vishwanath

A digital security breach, by which confidential information is leaked, does not only affect the agent whose system is infiltrated, but is also detrimental to other agents socially connected to the infiltrated system. Although it has been…

Social and Information Networks · Computer Science 2019-06-25 Bram de Witte , Paolo Frasca , Bastiaan Overvest , Judith Timmer

Constraints on agent's ability to pay play a major role in auction design for any setting where the magnitude of financial transactions is sufficiently large. Those constraints have been traditionally modeled in mechanism design as…

Computer Science and Game Theory · Computer Science 2014-04-22 Gagan Goel , Vahab Mirrokni , Renato Paes Leme

Blockchains have popularized automated market makers (AMMs). An AMM exchange is an application running on a blockchain which maintains a pool of crypto-assets and automatically trades assets with users governed by some pricing function that…

Computer Science and Game Theory · Computer Science 2025-09-16 T-H. Hubert Chan , Ke Wu , Elaine Shi

Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of options, this becomes a feasibility question: does there exist a…

Computer Science and Game Theory · Computer Science 2026-04-21 Davin Choo , Paul W. Goldberg , Nicholas Teh

We study an all-pay contest in which players with low abilities are filtered out before competing for prizes. We consider a setting where the designer admits a certain number of top players. The admitted players update their beliefs based…

Computer Science and Game Theory · Computer Science 2025-12-08 Fupeng Sun , Yanwei Sun , Chiwei Yan , Li Jin

Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…

Computer Science and Game Theory · Computer Science 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

We study the problem of selling a resource through an auction mechanism. The winning buyer in turn develops this resource to generate profit. Two forms of payment are considered: charging the winning buyer a one-time payment, or an initial…

Computer Science and Game Theory · Computer Science 2012-07-27 Vineet Abhishek , Bruce Hajek , Steven R. Williams

This paper investigates the behavior of simulated AI agents (large language models, or LLMs) in auctions, introducing a novel synthetic data-generating process to help facilitate the study and design of auctions. We find that LLMs -- when…

Computer Science and Game Theory · Computer Science 2025-07-15 Anand Shah , Kehang Zhu , Yanchen Jiang , Jeffrey G. Wang , Arif K. Dayi , John J. Horton , David C. Parkes

With the continuous expansion of Internet of Things (IoT) devices, edge computing mode has emerged in recent years to overcome the shortcomings of traditional cloud computing mode, such as high delay, network congestion, and large resource…

Networking and Internet Architecture · Computer Science 2022-06-08 Jianxiong Guo , Xingjian Ding , Weijia Jia

Defending against sophisticated cyber threats demands strategic allocation of limited security resources across complex network infrastructures. When the defender has limited defensive resources, the complexity of coordinating honeypot…

Computer Science and Game Theory · Computer Science 2025-05-23 Dongyoung Park , Gaby G. Dagher

We consider a multi-round auction setting motivated by pay-per-click auctions for Internet advertising. In each round the auctioneer selects an advertiser and shows her ad, which is then either clicked or not. An advertiser derives value…

Data Structures and Algorithms · Computer Science 2013-06-05 Moshe Babaioff , Yogeshwer Sharma , Aleksandrs Slivkins

We study a new "laminated" queueing model for orders on batched trading venues such as decentralised exchanges. The model aims to capture and generalise transaction queueing infrastructure that has arisen to organise MEV activity on public…

Trading and Market Microstructure · Quantitative Finance 2024-01-17 Andrew W. Macpherson

We initiate the study of the social welfare loss caused by corrupt auctioneers, both in single-item and multi-unit auctions. In our model, the auctioneer may collude with the winning bidders by letting them lower their bids in exchange for…

Computer Science and Game Theory · Computer Science 2022-05-10 Andries van Beek , Ruben Brokkelkamp , Guido Schäfer

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos
‹ Prev 1 8 9 10 Next ›