Published in: OASIcs, Volume 109, Eelco Visser Commemorative Symposium (EVCS 2023)
Houda Boukham, Guido Wachsmuth, Toine Hartman, Hamza Boucherit, Oskar van Rest, Hassan Chafi, Sungpack Hong, Martijn Dwars, Arnaud Delamare, and Dalila Chiadmi. Spoofax at Oracle: Domain-Specific Language Engineering for Large-Scale Graph Analytics. In Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), Volume 109, pp. 5:1-5:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{boukham_et_al:OASIcs.EVCS.2023.5, author = {Boukham, Houda and Wachsmuth, Guido and Hartman, Toine and Boucherit, Hamza and van Rest, Oskar and Chafi, Hassan and Hong, Sungpack and Dwars, Martijn and Delamare, Arnaud and Chiadmi, Dalila}, title = {{Spoofax at Oracle: Domain-Specific Language Engineering for Large-Scale Graph Analytics}}, booktitle = {Eelco Visser Commemorative Symposium (EVCS 2023)}, pages = {5:1--5:8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-267-9}, ISSN = {2190-6807}, year = {2023}, volume = {109}, editor = {L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.EVCS.2023.5}, URN = {urn:nbn:de:0030-drops-177756}, doi = {10.4230/OASIcs.EVCS.2023.5}, annote = {Keywords: language workbench, domain-specific language} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Tuomas Sandholm. Automated Mechanism Design. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{sandholm:DagSemProc.05011.5, author = {Sandholm, Tuomas}, title = {{Automated Mechanism Design}}, booktitle = {Computing and Markets}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.5}, URN = {urn:nbn:de:0030-drops-2677}, doi = {10.4230/DagSemProc.05011.5}, annote = {Keywords: Automated mechanism design, mechanism design} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Itai Ashlagi, Dov Monderer, and Moshe Tennenholtz. The Value of Correlation in Strategic Form Games. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{ashlagi_et_al:DagSemProc.05011.20, author = {Ashlagi, Itai and Monderer, Dov and Tennenholtz, Moshe}, title = {{The Value of Correlation in Strategic Form Games}}, booktitle = {Computing and Markets}, pages = {1--29}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.20}, URN = {urn:nbn:de:0030-drops-2317}, doi = {10.4230/DagSemProc.05011.20}, annote = {Keywords: Correlation, mediation, enforcement, equilibrium, mediator} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Daniel Lehmann, Rudolf Müller, and Tuomas Sandholm. 05011 Abstracts Collection – Computing and Markets. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{lehmann_et_al:DagSemProc.05011.1, author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas}, title = {{05011 Abstracts Collection – Computing and Markets}}, booktitle = {Computing and Markets}, pages = {1--26}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.1}, URN = {urn:nbn:de:0030-drops-2250}, doi = {10.4230/DagSemProc.05011.1}, annote = {Keywords: Algorithms, complexity, game theory, social choice, auctions, equilibrium} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Daniel Lehmann, Rudolf Müller, and Tuomas Sandholm. 05011 Executive Summary – Computing and Markets. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{lehmann_et_al:DagSemProc.05011.2, author = {Lehmann, Daniel and M\"{u}ller, Rudolf and Sandholm, Tuomas}, title = {{05011 Executive Summary – Computing and Markets}}, booktitle = {Computing and Markets}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.2}, URN = {urn:nbn:de:0030-drops-2248}, doi = {10.4230/DagSemProc.05011.2}, annote = {Keywords: Algorithms, complexity, game theory, social choice, auctions, equilibrium} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Kevin Leyton-Brown and Navin A.R. Bhat. Computing Nash Equilibria of Action-Graph Games. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{leytonbrown_et_al:DagSemProc.05011.6, author = {Leyton-Brown, Kevin and Bhat, Navin A.R.}, title = {{Computing Nash Equilibria of Action-Graph Games}}, booktitle = {Computing and Markets}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.6}, URN = {urn:nbn:de:0030-drops-2209}, doi = {10.4230/DagSemProc.05011.6}, annote = {Keywords: compact representation of games, action-graph games, Nash equilibria} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Kevin Leyton-Brown and Moshe Tennenholtz. Local-Effect Games. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{leytonbrown_et_al:DagSemProc.05011.11, author = {Leyton-Brown, Kevin and Tennenholtz, Moshe}, title = {{Local-Effect Games}}, booktitle = {Computing and Markets}, pages = {1--6}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.11}, URN = {urn:nbn:de:0030-drops-2190}, doi = {10.4230/DagSemProc.05011.11}, annote = {Keywords: compact representation of games, congestion games, local-effect} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Edward Anderson, Frank Kelly, and Richard Steinberg. A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{anderson_et_al:DagSemProc.05011.3, author = {Anderson, Edward and Kelly, Frank and Steinberg, Richard}, title = {{A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network}}, booktitle = {Computing and Markets}, pages = {1--31}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.3}, URN = {urn:nbn:de:0030-drops-2041}, doi = {10.4230/DagSemProc.05011.3}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Rudolf Müller, Andres Perea, and Sascha Wolf. A Network Approach to Bayes-Nash Incentive Compatible Mechanisms. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{muller_et_al:DagSemProc.05011.4, author = {M\"{u}ller, Rudolf and Perea, Andres and Wolf, Sascha}, title = {{A Network Approach to Bayes-Nash Incentive Compatible Mechanisms}}, booktitle = {Computing and Markets}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.4}, URN = {urn:nbn:de:0030-drops-2056}, doi = {10.4230/DagSemProc.05011.4}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Michal Penn, Maria Polukarov, and Moshe Tennenholtz. Congestion games with failures. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{penn_et_al:DagSemProc.05011.7, author = {Penn, Michal and Polukarov, Maria and Tennenholtz, Moshe}, title = {{Congestion games with failures}}, booktitle = {Computing and Markets}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.7}, URN = {urn:nbn:de:0030-drops-2098}, doi = {10.4230/DagSemProc.05011.7}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Hongwei Gui, Rudolf Müller, and Rakesh V. Vohra. Dominant Strategy Mechanisms with Multidimensional Types. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{hongweigui_et_al:DagSemProc.05011.8, author = {Hongwei Gui and M\"{u}ller, Rudolf and Vohra, Rakesh V.}, title = {{Dominant Strategy Mechanisms with Multidimensional Types}}, booktitle = {Computing and Markets}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.8}, URN = {urn:nbn:de:0030-drops-2107}, doi = {10.4230/DagSemProc.05011.8}, annote = {Keywords: Dominant Strategy, Farkas Lemma,} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Kazuo Murota. Fundamentals in Discrete Convex Analysis. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{murota:DagSemProc.05011.10, author = {Murota, Kazuo}, title = {{Fundamentals in Discrete Convex Analysis}}, booktitle = {Computing and Markets}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.10}, URN = {urn:nbn:de:0030-drops-2167}, doi = {10.4230/DagSemProc.05011.10}, annote = {Keywords: gross substitute, discrete convex functions, M-convex function, Fenchel-Legendre transformation} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Rann Smordinsky and Moshe Tennenholtz. Overcoming Free Riding in Multi-Party Computations. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{smordinsky_et_al:DagSemProc.05011.12, author = {Smordinsky, Rann and Tennenholtz, Moshe}, title = {{Overcoming Free Riding in Multi-Party Computations}}, booktitle = {Computing and Markets}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.12}, URN = {urn:nbn:de:0030-drops-2061}, doi = {10.4230/DagSemProc.05011.12}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Henner Gimpel. Reference-Dependent Preferences in Multi-Issue Bargaining. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{gimpel:DagSemProc.05011.13, author = {Gimpel, Henner}, title = {{Reference-Dependent Preferences in Multi-Issue Bargaining}}, booktitle = {Computing and Markets}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.13}, URN = {urn:nbn:de:0030-drops-2038}, doi = {10.4230/DagSemProc.05011.13}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio} }
Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)
Anna Osepayshvili, Michael Wellman, Daniel Reeves, and Jeffrey MacKie-Mason. Self-Confirming Price Prediction for Bidding in Simultaneous Ascending Auctions. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{osepayshvili_et_al:DagSemProc.05011.14, author = {Osepayshvili, Anna and Wellman, Michael and Reeves, Daniel and MacKie-Mason, Jeffrey}, title = {{Self-Confirming Price Prediction for Bidding in Simultaneous Ascending Auctions}}, booktitle = {Computing and Markets}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5011}, editor = {Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.14}, URN = {urn:nbn:de:0030-drops-2020}, doi = {10.4230/DagSemProc.05011.14}, annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategies} }
Feedback for Dagstuhl Publishing