Search Results

Documents authored by Herings, P. Jean-Jacques

Document
DOI: 10.4230/DagSemProc.07471.1
07471 Abstracts Collection – Equilibrium Computation

Authors: P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Eva Tardos, and Bernhard von Stengel

Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)

Abstract
From 18 to 23 November 2007, the Dagstuhl Seminar 07471 ``Equilibrium Computation'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Eva Tardos, and Bernhard von Stengel. 07471 Abstracts Collection – Equilibrium Computation. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 7471, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{herings_et_al:DagSemProc.07471.1,
  author =	{Herings, P. Jean-Jacques and Jurdzinski, Marcin and Bro Miltersen, Peter and Tardos, Eva and von Stengel, Bernhard},
  title =	{{07471 Abstracts Collection – Equilibrium Computation}},
  booktitle =	{Equilibrium Computation},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7471},
  editor =	{P. Jean-Jacques Herings and Marcin Jurdzinski and Peter Bro Miltersen and Eva Tardos and Bernhard von Stengel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07471.1},
  URN =		{urn:nbn:de:0030-drops-15286},
  doi =		{10.4230/DagSemProc.07471.1},
  annote =	{Keywords: Equilibrium, algorithm, polynomial time, game theory, economics}
}
Document
DOI: 10.4230/DagSemProc.07471.3
Homotopy Methods to Compute Equilibria in Game Theory

Authors: P. Jean-Jacques Herings and Ronald Peeters

Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)

Abstract
This paper presents a survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by various selection theories. We present the relevant techniques underlying homotopy algorithms. We give detailed expositions of the Lemke-Howson algorithm and the van den Elzen-Talman algorithm to compute Nash equilibria in 2-person games, and the Herings-van den Elzen, Herings-Peeters, and McKelvey-Palfrey algorithms to compute Nash equilibria in general $n$-person games. We explain how the main ideas can be extended to compute equilibria in extensive form and dynamic games, and how homotopies can be used to compute all Nash equilibria.
Cite as

P. Jean-Jacques Herings and Ronald Peeters. Homotopy Methods to Compute Equilibria in Game Theory. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 7471, pp. 1-40, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{herings_et_al:DagSemProc.07471.3,
  author =	{Herings, P. Jean-Jacques and Peeters, Ronald},
  title =	{{Homotopy Methods to Compute Equilibria in Game Theory}},
  booktitle =	{Equilibrium Computation},
  pages =	{1--40},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7471},
  editor =	{P. Jean-Jacques Herings and Marcin Jurdzinski and Peter Bro Miltersen and Eva Tardos and Bernhard von Stengel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07471.3},
  URN =		{urn:nbn:de:0030-drops-15257},
  doi =		{10.4230/DagSemProc.07471.3},
  annote =	{Keywords: Homotopy, Equilibrium computation, Non-cooperative games, Nash Equilibrium}
}
Document
DOI: 10.4230/DagSemProc.07271.7
Inefficiency of equilibria in query auctions with continuous valuations

Authors: Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, and Dries Vermeulen

Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)

Abstract
We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of the auction is infinite for almost all realizations of valuations of the bidders. In contrast we show that, when we allow for inefficient allocations with arbitrarily small probability, there is a query auction (to be more specific, a bisection auction) that attains this level of approximate efficiency in equilibrium, while additionally the running time of the auction in equilibrium is finite for all realizations of valuations.
Cite as

Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, and Dries Vermeulen. Inefficiency of equilibria in query auctions with continuous valuations. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{grigorieva_et_al:DagSemProc.07271.7,
  author =	{Grigorieva, Elena and Herings, P. Jean-Jacques and M\"{u}ller, Rudolf and Vermeulen, Dries},
  title =	{{Inefficiency of equilibria in query auctions with continuous valuations}},
  booktitle =	{Computational Social Systems and the Internet},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7271},
  editor =	{Peter Cramton and Rudolf M\"{u}ller and Eva Tardos and Moshe Tennenholtz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.7},
  URN =		{urn:nbn:de:0030-drops-11616},
  doi =		{10.4230/DagSemProc.07271.7},
  annote =	{Keywords: Query auctions, ex post equilibrium, efficiency}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact