Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item auctions among bidders with independent valuations. In this setting, relatively simple deterministic auction mechanisms achieve revenue optimality. When bidders have correlated valuations, designing the revenue-optimal deterministic auction is a computationally demanding problem; indeed, Papadimitriou and Pierrakos (STOC ’11) proved that it is APX-hard, obtaining an explicit inapproximability factor of 1999/2000 e 99.95p. In the current article,  strengthen this inapproximability factor to 63/64 a 98.5p. Our proof is based on a gap-preserving reduction from the M ax -NM 3SAT problem; a variant of the maximum satisfiability problem where each clause has exactly three literals and no clause contains both negated and unnegated literals.  furthermore show that the gap beten the revenue of deterministic and randomized auctions can be as low as 13/14 a 92.9p, improving an explicit gap of 947/948 a 99.9p by Dobzinski, Fu, and Kleinberg (STOC ’11).
['Ioannis Caragiannis', 'Christos Kaklamanis', 'Maria Kyropoulou']
I am writing a research paper on a idea Limitations of Deterministic Auction Design for Correlated Bidders
[{"from": "human", "value": "I am writing a research paper on a idea Limitations of Deterministic Auction Design for Correlated Bidders"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The seminal work of Myerson (Mathematics of OR \u201981) characterizes incentive-compatible single-item auctions among bidders with independent valuations. In this setting, relatively simple deterministic auction mechanisms achieve revenue optimality. When bidders have correlated valuations, designing the revenue-optimal deterministic auction is a computationally demanding problem; indeed, Papadimitriou and Pierrakos (STOC \u201911) proved that it is APX-hard, obtaining an explicit inapproximability factor of 1999/2000 e 99.95p. In the current article,  strengthen this inapproximability factor to 63/64 a 98.5p. Our proof is based on a gap-preserving reduction from the M ax -NM 3SAT problem; a variant of the maximum satisfiability problem where each clause has exactly three literals and no clause contains both negated and unnegated literals.  furthermore show that the gap beten the revenue of deterministic and randomized auctions can be as low as 13/14 a 92.9p, improving an explicit gap of 947/948 a 99.9p by Dobzinski, Fu, and Kleinberg (STOC \u201911)."}]