Please use this identifier to cite or link to this item:
Title: Auctions with rational adversary
Authors: De, Sourya Joyee
Pal, Asim Kumar
Keywords: Secret Sharing
Sequential Equilibrium
Secure Computation
Issue Date: 2013
Publisher: SCOPUS
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series/Report no.: 8303 LNCS
Abstract: Security of various types of online auctions has received a considerable attention from researchers. However, very few works have analyzed the problem of security in online sealed-bid auctions from the point of view of rational participants. The paper deals with an online auction scenario where two types of participants co-exist: 1) a party corrupted by a rational adversary that have positive utilities from information gained and that has no valuation for the items on auction enabling them to bid arbitrarily and 2) rational parties that are privacy conscious, positively value information gain and have a valuation for items on auction. The secure auction protocol proposed here addresses 1) privacy concerns of the rational players from themselves as well as the rational adversary; 2) prevention of 'throwing away' of contracts by rational adversaries and 3) prevention of sellers from obtaining their copy of the contract while winners do not receive theirs. © 2013 Springer-Verlag.
Description: De, Sourya Joyee, Management Information Systems Group, Indian Institute of Management Calcutta, India; Pal, Asim Kumar., Management Information Systems Group, Indian Institute of Management Calcutta, India
ISSN/ISBN - 03029743
DOI - 10.1007/978-3-642-45204-8_7
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.