Combinatorial auctions with decreasing marginal utilities

B Lehmann, D Lehmann, N Nisan - … of the 3rd ACM conference on …, 2001 - dl.acm.org
In most of microeconomic theory, consumers are assumed to exhibit decreasing marginal
utilities. This paper considers combinatorial auctions among such buyers. The valuations of …

Design of a multi–unit double auction e–market

P Huang, A Scheller–Wolf… - Computational …, 2002 - Wiley Online Library
We envision a future economy where e–markets will play an essential role as exchange
hubs for commodities and services. Future e–markets should be designed to be robust to …

An auction method for resource allocation in computational grids

H Izakian, A Abraham, BT Ladani - Future generation computer systems, 2010 - Elsevier
A computational grid is composed of a set of resource consumers and resources providers.
Usually these entities are independent and making decisions autonomously based on their …

Mechanism Design for ZK-Rollup Prover Markets

W Wang, L Zhou, A Yaish, F Zhang, B Fisch… - arxiv preprint arxiv …, 2024 - arxiv.org
In ZK-Rollups, provers spend significant computational resources to generate validity proofs.
Their costs should be compensated properly, so a sustainable prover market can form over …

Double auction protocols for resource allocation in grids

U Kant, D Grosu - … : Coding and Computing (ITCC'05)-Volume II, 2005 - ieeexplore.ieee.org
In this paper we propose the double auction allocation model for grids, and three double
auction protocols for resource allocation: Preston-McAfee Double Auction Protocol (PMDA) …

Towards truthful auction for big data trading

D An, Q Yang, W Yu, D Li, Y Zhang… - 2017 IEEE 36th …, 2017 - ieeexplore.ieee.org
In this paper, we address the issue of data trading in big data markets. Data trading
problems have attracted increased attention recently, as the economic benefits and potential …

[PDF][PDF] Robust multi-unit auction protocol against false-name bids

M Yokoo, Y Sakurai, S Matsubara - … JOINT CONFERENCE ON …, 2001 - researchgate.net
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against
false-name bids. Internet auctions have become an integral part of Electronic Commerce …

A continuous double auction method for resource allocation in computational grids

H Izakian, BT Ladani, K Zamanifar… - … IEEE Symposium on …, 2009 - ieeexplore.ieee.org
In this paper, we introduce a continuous double auction method for grid resource allocation
in which resources are considered as provider agents and users as consumer agents. In …

False-name bidding and economic efficiency in combinatorial auctions

C Alkalay-Houlihan, A Vetta - Proceedings of the AAAI Conference on …, 2014 - ojs.aaai.org
Combinatorial auctions are multiple-item auctions in which bidders may place bids on any
package (subset) of goods. This additional expressibility produces benefits that have led to …

Robust double auction protocol against false-name bids

M Yokoo, Y Sakurai, S Matsubara - Decision support systems, 2005 - Elsevier
In this paper, we develop a new double auction protocol called the Threshold Price Double
auction (TPD) protocol, which is dominant-strategy incentive compatible even if participants …