## Abstract

We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, our assumption being that bidders primarily care about monetary payoff and secondarily worry about exposing information about their type to other players and learning information about other players’ types, that is, bidders are

*greedy then paranoid. To treat privacy explicitly within the game theoretic context, we put forward a novel*Supported by the*hybrid utility model that considers both monetary and privacy components in players’ payoffs.*We show how to use rational cryptography to approximately implement any given*ex interim individually strictly rational equilibrium of such an auction without a trusted mediator through a cryptographic protocol that uses only point-to-point authenticated channels between the players. By “ex interim individually strictly rational” we mean that, given its type and before making its move, each player has a strictly positive expected utility. By “approximately implement” we mean that, under cryptographic assumptions, running the protocol is a computational Nash equilibrium with a payoff profile negligibly close to the original equilibrium.**Center for Algorithmic Game Theory, funded by The Carlsberg Foundation.*Originalsprog | Engelsk |
---|---|

Bogserie | Lecture Notes in Computer Science |

Vol/bind | 5677 |

Sider (fra-til) | 541-558 |

Antal sider | 18 |

ISSN | 0302-9743 |

DOI | |

Status | Udgivet - 2009 |

Begivenhed | International Cryptology Conference- CRYPTO 2009 - Santa Barbara, USA Varighed: 16 aug. 2009 → 20 aug. 2009 Konferencens nummer: 29 |

### Konference

Konference | International Cryptology Conference- CRYPTO 2009 |
---|---|

Nummer | 29 |

Land/Område | USA |

By | Santa Barbara |

Periode | 16/08/2009 → 20/08/2009 |