Published in: LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, and Yulong Zeng. Walrasian Pricing in Multi-Unit Auctions. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 80:1-80:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{branzei_et_al:LIPIcs.MFCS.2017.80, author = {Br\^{a}nzei, Simina and Filos-Ratsikas, Aris and Miltersen, Peter Bro and Zeng, Yulong}, title = {{Walrasian Pricing in Multi-Unit Auctions}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-046-0}, ISSN = {1868-8969}, year = {2017}, volume = {83}, editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.80}, URN = {urn:nbn:de:0030-drops-81197}, doi = {10.4230/LIPIcs.MFCS.2017.80}, annote = {Keywords: mechanism design, multi-unit auctions, Walrasian pricing, market share} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Peter Bro Miltersen. Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 11-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{miltersen:LIPIcs.STACS.2014.11, author = {Miltersen, Peter Bro}, title = {{Semi-algebraic geometry in computational game theory - a consumer's perspective}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {11--12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.11}, URN = {urn:nbn:de:0030-drops-44994}, doi = {10.4230/LIPIcs.STACS.2014.11}, annote = {Keywords: Real Algebraic Geometry, Computational Game Theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 10171, Equilibrium Computation (2010)
Edith Elkind, Nimrod Megiddo, Peter Bro Miltersen, Bernhard von Stengel, and Vijay V. Vazirani. 10171 Abstracts Collection – Equilibrium Computation. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 10171, pp. 1-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{elkind_et_al:DagSemProc.10171.1, author = {Elkind, Edith and Megiddo, Nimrod and Miltersen, Peter Bro and von Stengel, Bernhard and Vazirani, Vijay V.}, title = {{10171 Abstracts Collection – Equilibrium Computation}}, booktitle = {Equilibrium Computation}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10171}, editor = {Edith Elkind and Nimrod Megiddo and Peter Bro Miltersen and Vijay V. Vazirani and Bernahrd von Stengel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10171.1}, URN = {urn:nbn:de:0030-drops-26738}, doi = {10.4230/DagSemProc.10171.1}, annote = {Keywords: Equilibrium computation, algorithmic game theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 10171, Equilibrium Computation (2010)
James B. Orlin. Improved Algorithms for Computing Fisher's Market Clearing Prices. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 10171, pp. 1-19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{orlin:DagSemProc.10171.2, author = {Orlin, James B.}, title = {{Improved Algorithms for Computing Fisher's Market Clearing Prices}}, booktitle = {Equilibrium Computation}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10171}, editor = {Edith Elkind and Nimrod Megiddo and Peter Bro Miltersen and Vijay V. Vazirani and Bernahrd von Stengel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10171.2}, URN = {urn:nbn:de:0030-drops-26720}, doi = {10.4230/DagSemProc.10171.2}, annote = {Keywords: Market equilibrium, Fisher, strongly polynomial} }
Published in: Dagstuhl Seminar Proceedings, Volume 10171, Equilibrium Computation (2010)
Michael J. Todd. Proportional Response as Iterated Cobb-Douglas. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 10171, pp. 1-6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{todd:DagSemProc.10171.3, author = {Todd, Michael J.}, title = {{Proportional Response as Iterated Cobb-Douglas}}, booktitle = {Equilibrium Computation}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10171}, editor = {Edith Elkind and Nimrod Megiddo and Peter Bro Miltersen and Vijay V. Vazirani and Bernahrd von Stengel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10171.3}, URN = {urn:nbn:de:0030-drops-26713}, doi = {10.4230/DagSemProc.10171.3}, annote = {Keywords: Computing equilibria, Fisher market, proportional response algorithm, Cobb-Douglas utilities} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Kristoffer Arnsfelt Hansen. Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{hansen:DagSemProc.08381.4, author = {Hansen, Kristoffer Arnsfelt}, title = {{Depth Reduction for Circuits with a Single Layer of Modular Counting Gates}}, booktitle = {Computational Complexity of Discrete Problems}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.4}, URN = {urn:nbn:de:0030-drops-17824}, doi = {10.4230/DagSemProc.08381.4}, annote = {Keywords: Boolean Circuits, Randomized Polynomials, Fourier sums} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Eli Ben-Sasson and Jakob Nordström. Understanding space in resolution: optimal lower bounds and exponential trade-offs. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{bensasson_et_al:DagSemProc.08381.6, author = {Ben-Sasson, Eli and Nordstr\"{o}m, Jakob}, title = {{Understanding space in resolution: optimal lower bounds and exponential trade-offs}}, booktitle = {Computational Complexity of Discrete Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.6}, URN = {urn:nbn:de:0030-drops-17815}, doi = {10.4230/DagSemProc.08381.6}, annote = {Keywords: Proof complexity, Resolution, Pebbling.} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek. 08381 Abstracts Collection – Computational Complexity of Discrete Problems. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{miltersen_et_al:DagSemProc.08381.1, author = {Miltersen, Peter Bro and Reischuk, R\"{u}diger and Schnitger, Georg and van Melkebeek, Dieter}, title = {{08381 Abstracts Collection – Computational Complexity of Discrete Problems}}, booktitle = {Computational Complexity of Discrete Problems}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.1}, URN = {none}, doi = {10.4230/DagSemProc.08381.1}, annote = {Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, computational learning, communication complexity, query complexity, hardness of approximation} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, and Dieter van Melkebeek. 08381 Executive Summary – Computational Complexity of Discrete Problems. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{miltersen_et_al:DagSemProc.08381.2, author = {Miltersen, Peter Bro and Reischuk, R\"{u}diger and Schnitger, Georg and van Melkebeek, Dieter}, title = {{08381 Executive Summary – Computational Complexity of Discrete Problems}}, booktitle = {Computational Complexity of Discrete Problems}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.2}, URN = {urn:nbn:de:0030-drops-17789}, doi = {10.4230/DagSemProc.08381.2}, annote = {Keywords: Computational complexity, discrete problems, Turing machines, circuits, proof complexity, pseudorandomness, derandomization, cryptography, computational learning, communication complexity, query complexity, hardness of approximation} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Troy Lee and Adi Shraibman. Approximation norms and duality for communication complexity lower bounds. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{lee_et_al:DagSemProc.08381.3, author = {Lee, Troy and Shraibman, Adi}, title = {{Approximation norms and duality for communication complexity lower bounds}}, booktitle = {Computational Complexity of Discrete Problems}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.3}, URN = {urn:nbn:de:0030-drops-17768}, doi = {10.4230/DagSemProc.08381.3}, annote = {Keywords: Communication complexity, lower bounds} }
Published in: Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008)
Kiran Kedlaya and Christopher Umans. Fast polynomial factorization and modular composition. In Computational Complexity of Discrete Problems. Dagstuhl Seminar Proceedings, Volume 8381, pp. 1-33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kedlaya_et_al:DagSemProc.08381.5, author = {Kedlaya, Kiran and Umans, Christopher}, title = {{Fast polynomial factorization and modular composition}}, booktitle = {Computational Complexity of Discrete Problems}, pages = {1--33}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8381}, editor = {Peter Bro Miltersen and R\"{u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.5}, URN = {urn:nbn:de:0030-drops-17771}, doi = {10.4230/DagSemProc.08381.5}, annote = {Keywords: Modular composition; polynomial factorization; multipoint evaluation; Chinese Remaindering} }
Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)
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)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)
Anne Balthasar. Equilibrium Tracing in Bimatrix Games. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 7471, pp. 1-14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{balthasar:DagSemProc.07471.2, author = {Balthasar, Anne}, title = {{Equilibrium Tracing in Bimatrix Games}}, booktitle = {Equilibrium Computation}, pages = {1--14}, 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.2}, URN = {urn:nbn:de:0030-drops-15265}, doi = {10.4230/DagSemProc.07471.2}, annote = {Keywords: Bimatrix games, Equilibrium computation, Homotopy methods, Index} }
Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)
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)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7471, Equilibrium Computation (2008)
Nir Halman. Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems. In Equilibrium Computation. Dagstuhl Seminar Proceedings, Volume 7471, pp. 1-2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{halman:DagSemProc.07471.4, author = {Halman, Nir}, title = {{Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games are all LP-Type Problems}}, booktitle = {Equilibrium Computation}, pages = {1--2}, 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.4}, URN = {urn:nbn:de:0030-drops-15274}, doi = {10.4230/DagSemProc.07471.4}, annote = {Keywords: Subexponential algorithm, LP-type framework} }
Feedback for Dagstuhl Publishing