中文
相关论文

相关论文: PS-TRUST: Provably Secure Solution for Truthful Do…

200 篇论文

Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are either not truthful, or do not guarantee an…

计算机科学与博弈论 · 计算机科学 2018-05-02 Erel Segal-Halevi , Avinatan Hassidim , Yonatan Aumann

We present a general framework for designing approximately revenue-optimal mechanisms for multi-item additive auctions, which applies to both truthful and non-truthful auctions. Given a (not necessarily truthful) single-item auction format…

计算机科学与博弈论 · 计算机科学 2022-09-23 Constantinos Daskalakis , Maxwell Fishelson , Brendan Lucier , Vasilis Syrgkanis , Santhoshini Velusamy

In auction theory, cryptography has been used to achieve anonymity of the participants, security and privacy of the bids, secure computation and to simulate mediator (auctioneer). Auction theory focuses on revenue and Cryptography focuses…

计算机科学与博弈论 · 计算机科学 2012-10-25 Amjed Shareef

Federated knowledge discovery and data mining are challenged to assess the trustworthiness of data originating from autonomous sources while protecting confidentiality and privacy. Truth-finding algorithms help corroborate data from…

密码学与安全 · 计算机科学 2023-05-25 Angelo Saadeh , Pierre Senellart , Stéphane Bressan

We consider a revenue-maximizing seller with a single item for sale to multiple buyers with i.i.d. valuations. Akbarpour and Li (2020) show that the only optimal, credible, strategyproof auction is the ascending price auction with reserves…

计算机科学与博弈论 · 计算机科学 2023-10-31 Meryem Essaidi , Matheus V. X. Ferreira , S. Matthew Weinberg

We study methods to enhance statistical privacy in blockchain transactions. We analyze economic mechanisms for privacy-aware transaction owners whose utility depends not only on the outcome of the mechanism but also negatively on the…

计算机科学与博弈论 · 计算机科学 2026-05-19 Georgios Chionas , Olga Gorelkina , Piotr Krysta , Rida Laraki

Today, many auctions are carried out with the help of intermediary platforms like Google and eBay. We refer to such auctions as platform-assisted auctions.Traditionally, the auction theory literature mainly focuses on designing auctions…

计算机科学与博弈论 · 计算机科学 2025-01-07 Hao Chung , Ke Wu , Elaine Shi

A seller wants to sell a good to a set of bidders using a credible mechanism. We show that when the seller has private information about her cost, it is impossible for a static mechanism to achieve the optimal revenue. In particular, even…

理论经济学 · 经济学 2025-09-29 Martino Banchio , Andrzej Skrzypacz , Frank Yang

Simultaneous ascending auctions present agents with the exposure problem: bidding to acquire a bundle risks the possibility of obtaining an undesired subset of the goods. Auction theory provides little guidance for dealing with this…

计算机科学与博弈论 · 计算机科学 2012-07-09 Anna Osepayshvili , Michael P. Wellman , Daniel Reeves , Jeffrey K. MacKie-Mason

Double auctions are widely used in financial markets, such as those for stocks, derivatives, currencies, and commodities, to match demand and supply. Once all buyers and sellers have placed their trade requests, the exchange determines how…

计算机科学中的逻辑 · 计算机科学 2024-10-25 Mohit Garg , N. Raja , Suneel Sarswat , Abhishek Kr Singh

Designing truthful, revenue maximizing auctions is a core problem of auction design. Multi-item settings have long been elusive. Recent work (arXiv:1706.03459) introduces effective deep learning techniques to find such auctions for the…

计算机科学与博弈论 · 计算机科学 2021-04-02 Daniel Reusche , Nicolás Della Penna

Auctions have a long history, having been recorded as early as 500 B.C. Nowadays, electronic auctions have been a great success and are increasingly used. Many cryptographic protocols have been proposed to address the various security…

密码学与安全 · 计算机科学 2013-05-15 Jannik Dreier , Jean-Guillaume Dumas , Pascal Lafourcade

This paper examines knapsack auctions as a method to solve the knapsack problem with incomplete information, where object values are private and sizes are public. We analyze three auction types-uniform price (UP), discriminatory price (DP),…

计算机科学与博弈论 · 计算机科学 2024-05-02 Peyman Khezr , Vijay Mohan , Lionel Page

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…

计算机科学与博弈论 · 计算机科学 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

We study information design in click-through auctions, in which the bidders/advertisers bid for winning an opportunity to show their ads but only pay for realized clicks. The payment may or may not happen, and its probability is called the…

计算机科学与博弈论 · 计算机科学 2024-04-23 Junjie Chen , Minming Li , Haifeng Xu , Song Zuo

In an open-bid auction, a bidder can know the budgets of other bidders. Thus, a sealed-bid auction that hides bidding prices is desirable. However, in previous sealed-bid auction protocols, it has been difficult to provide a ``fund…

密码学与安全 · 计算机科学 2023-12-14 Kota Chin , Keita Emura , Kazumasa Omote , Shingo Sato

We provide the first direct test of how the credibility of an auction format affects bidding behavior and final outcomes. To do so, we conduct a series of laboratory experiments where the role of the seller is played by a human subject who…

综合经济学 · 经济学 2025-03-19 Ahrash Dianat , Mikhail Freer

We present algorithms for implementing local spectrum redistribution in wireless networks using a mechanism design approach. For example, in single-hop request scheduling, secondary users are modeled as rational agents that have private…

计算机科学与博弈论 · 计算机科学 2013-05-13 Martin Hoefer , Thomas Kesselheim

Lately, Non-Fungible Tokens (NFTs), i.e., uniquely discernible assets on a blockchain, have skyrocketed in popularity by addressing a broad audience. However, the typical NFT auctioning procedures are conducted in various, ad hoc ways,…

计算机科学与博弈论 · 计算机科学 2022-09-26 Jason Milionis , Dean Hirsch , Andy Arditi , Pranav Garimidi

We consider a revenue-optimizing auctioneer in single-dimensional environments with matroid feasibility constraints. Akbarpour and Li (2020) argue that any revenue-optimal, truthful, and credible mechanism requires unbounded communication.…

计算机科学与博弈论 · 计算机科学 2025-07-08 Aadityan Ganesh , Qianfan Zhang