@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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,}
}
@InProceedings{day_et_al:DagSemProc.05011.9,
author = {Day, Robert and Raghavan, S.},
title = {{Fair Payments for Efficient Allocations in Public Sector Combinatorial Auctions}},
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.9},
URN = {urn:nbn:de:0030-drops-1832},
doi = {10.4230/DagSemProc.05011.9},
annote = {Keywords: auctions , core , bidder-Pareto-optimal , constraint generation , VCG payments , proxy auctions , combinatorial auctions}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@InProceedings{feldmann:DagSemProc.05011.15,
author = {Feldmann, Rainer},
title = {{Selfish Routing of Splittable Flow with Respect to Maximum Congestion}},
booktitle = {Computing and Markets},
pages = {1--12},
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.15},
URN = {urn:nbn:de:0030-drops-1991},
doi = {10.4230/DagSemProc.05011.15},
annote = {Keywords: selfish routing , coordination ratio}
}
@InProceedings{sandholm_et_al:DagSemProc.05011.16,
author = {Sandholm, Tuomas and Gilpin, Andrew},
title = {{Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation}},
booktitle = {Computing and Markets},
pages = {1--17},
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.16},
URN = {urn:nbn:de:0030-drops-2075},
doi = {10.4230/DagSemProc.05011.16},
annote = {Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio}
}
@InProceedings{brandt_et_al:DagSemProc.05011.17,
author = {Brandt, Felix and Sandholm, Tuomas and Shoham, Yoav},
title = {{Spiteful Bidding in Sealed-Bid Auctions}},
booktitle = {Computing and Markets},
pages = {1--16},
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.17},
URN = {urn:nbn:de:0030-drops-1987},
doi = {10.4230/DagSemProc.05011.17},
annote = {Keywords: Auctions , Externalities , Spite , Revenue}
}
@InProceedings{altman:DagSemProc.05011.18,
author = {Altman, Alon},
title = {{The PageRank Axioms}},
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.18},
URN = {urn:nbn:de:0030-drops-1972},
doi = {10.4230/DagSemProc.05011.18},
annote = {Keywords: pagerank , social choice , ranking system}
}
@InProceedings{gairing_et_al:DagSemProc.05011.19,
author = {Gairing, Martin and L\"{u}cking, Thomas and Mavronicolas, Marios and Monien, Burkhard},
title = {{The Price of Anarchy for Polynomial Social Cost}},
booktitle = {Computing and Markets},
pages = {1--12},
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.19},
URN = {urn:nbn:de:0030-drops-2005},
doi = {10.4230/DagSemProc.05011.19},
annote = {Keywords: selfish routing , KP-model , price of anarchy , fully mixed Nash Equilibrium}
}
@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing