Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)
Birgit Heydenreich, Debasis Mishra, Rudolf Müller, and Marc Uetz. Optimal Mechanisms for Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{heydenreich_et_al:DagSemProc.10071.7, author = {Heydenreich, Birgit and Mishra, Debasis and M\"{u}ller, Rudolf and Uetz, Marc}, title = {{Optimal Mechanisms for Scheduling}}, booktitle = {Scheduling}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10071}, editor = {Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.7}, URN = {urn:nbn:de:0030-drops-25401}, doi = {10.4230/DagSemProc.10071.7}, annote = {Keywords: Optimal Mechanism Design, Scheduling, Job Agents, Smith's Rule} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Ely Porat and Amir Rotschild. Explicit Non-Adaptive Combinatorial Group Testing Schemes. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{porat_et_al:DagSemProc.09281.2, author = {Porat, Ely and Rotschild, Amir}, title = {{Explicit Non-Adaptive Combinatorial Group Testing Schemes}}, booktitle = {Search Methodologies}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.2}, URN = {urn:nbn:de:0030-drops-22414}, doi = {10.4230/DagSemProc.09281.2}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Raphael Clifford, Klim Efremo, Ely Porat, and Amir Rotschild. Pattern matching with don't cares and few errors. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{clifford_et_al:DagSemProc.09281.5, author = {Clifford, Raphael and Efremo, Klim and Porat, Ely and Rotschild, Amir}, title = {{Pattern matching with don't cares and few errors}}, booktitle = {Search Methodologies}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.5}, URN = {urn:nbn:de:0030-drops-22442}, doi = {10.4230/DagSemProc.09281.5}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Gábor Wiener. Rounds in Combinatorial Search. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{wiener:DagSemProc.09281.6, author = {Wiener, G\'{a}bor}, title = {{Rounds in Combinatorial Search}}, booktitle = {Search Methodologies}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.6}, URN = {urn:nbn:de:0030-drops-22399}, doi = {10.4230/DagSemProc.09281.6}, annote = {Keywords: Search, group testing, adaptiveness, hypergraph, trace} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Peter Cramton, Rudolf Müller, Eva Tardos, and Moshe Tennenholtz. 07271 Abstracts Collection – Computational Social Systems and the Internet. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{cramton_et_al:DagSemProc.07271.1, author = {Cramton, Peter and M\"{u}ller, Rudolf and Tardos, Eva and Tennenholtz, Moshe}, title = {{07271 Abstracts Collection – Computational Social Systems and the Internet }}, booktitle = {Computational Social Systems and the Internet}, pages = {1--25}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.1}, URN = {urn:nbn:de:0030-drops-11666}, doi = {10.4230/DagSemProc.07271.1}, annote = {Keywords: Mechanism Design, Combinatorial Auctions, Social Choice Theory, Behavioral Economics, Computational Game Theory, Social Networks} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Peter Cramton, Rudolf Müller, Eva Tardos, and Moshe Tennenholtz. 07271 Summary – Computational Social Systems and the Internet. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{cramton_et_al:DagSemProc.07271.2, author = {Cramton, Peter and M\"{u}ller, Rudolf and Tardos, Eva and Tennenholtz, Moshe}, title = {{07271 Summary – Computational Social Systems and the Internet }}, booktitle = {Computational Social Systems and the Internet}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.2}, URN = {urn:nbn:de:0030-drops-11642}, doi = {10.4230/DagSemProc.07271.2}, annote = {Keywords: Mechanism Design, Combinatorial Auctions, Social Choice Theory, Behavioral Economics, Computational Game Theory, Social Networks} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Alon Altman and Moshe Tennenholtz. An Axiomatic Approach to Personalized Ranking Systems. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{altman_et_al:DagSemProc.07271.3, author = {Altman, Alon and Tennenholtz, Moshe}, title = {{An Axiomatic Approach to Personalized Ranking Systems}}, booktitle = {Computational Social Systems and the Internet}, pages = {1--25}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.3}, URN = {urn:nbn:de:0030-drops-11527}, doi = {10.4230/DagSemProc.07271.3}, annote = {Keywords: Ranking systems, trust, axiomatization, incentives, mechanism design, game theory} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Vincent Conitzer. Anonymity-Proof Voting Rules. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{conitzer:DagSemProc.07271.4, author = {Conitzer, Vincent}, title = {{Anonymity-Proof Voting Rules}}, booktitle = {Computational Social Systems and the Internet}, pages = {1--15}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.4}, URN = {urn:nbn:de:0030-drops-11658}, doi = {10.4230/DagSemProc.07271.4}, annote = {Keywords: Mechanism design, social choice, false-name-proofness, verifying identities, combinatorial auctions} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Wedad Elmaghraby and Nathan Larson. Auction Design with Avoidable Fixed Costs: An Experimental Approach. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{elmaghraby_et_al:DagSemProc.07271.5, author = {Elmaghraby, Wedad and Larson, Nathan}, title = {{Auction Design with Avoidable Fixed Costs: An Experimental Approach}}, booktitle = {Computational Social Systems and the Internet}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.5}, URN = {urn:nbn:de:0030-drops-11579}, doi = {10.4230/DagSemProc.07271.5}, annote = {Keywords: Auctions, Experimental, Procurement, Synergies, Asymmetric Bidders} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Ofer Dekel, Felix Fischer, and Ariel D. Procaccia. Incentive Compatible Regression Learning. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{dekel_et_al:DagSemProc.07271.6, author = {Dekel, Ofer and Fischer, Felix and Procaccia, Ariel D.}, title = {{Incentive Compatible Regression Learning}}, booktitle = {Computational Social Systems and the Internet}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.6}, URN = {urn:nbn:de:0030-drops-11622}, doi = {10.4230/DagSemProc.07271.6}, annote = {Keywords: Machine learning, regression, mechanism design} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
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)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Maria-Florina Balcan. Item Pricing for Revenue Maximization in Combinatorial Auctions. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{balcan:DagSemProc.07271.8, author = {Balcan, Maria-Florina}, title = {{Item Pricing for Revenue Maximization in Combinatorial Auctions}}, booktitle = {Computational Social Systems and the Internet}, pages = {1--2}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.8}, URN = {urn:nbn:de:0030-drops-11534}, doi = {10.4230/DagSemProc.07271.8}, annote = {Keywords: Item Pricing, Revenue Maximizing, Combinatorial Auctions} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Elmar Wolfstetter and Thomas Giebe. License Auctions with Royalty Contracts for (Winners and) Losers. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{wolfstetter_et_al:DagSemProc.07271.9, author = {Wolfstetter, Elmar and Giebe, Thomas}, title = {{License Auctions with Royalty Contracts for (Winners and) Losers}}, booktitle = {Computational Social Systems and the Internet}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.9}, URN = {urn:nbn:de:0030-drops-11514}, doi = {10.4230/DagSemProc.07271.9}, annote = {Keywords: Auctions, Patents, Licensing} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Vincent Conitzer. Limited Verification of Identities to Induce False-Name-Proofness. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{conitzer:DagSemProc.07271.10, author = {Conitzer, Vincent}, title = {{Limited Verification of Identities to Induce False-Name-Proofness}}, booktitle = {Computational Social Systems and the Internet}, pages = {1--10}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.10}, URN = {urn:nbn:de:0030-drops-11569}, doi = {10.4230/DagSemProc.07271.10}, annote = {Keywords: Mechanism design, social choice, false-name-proofness, verifying identities, combinatorial auctions} }
Published in: Dagstuhl Seminar Proceedings, Volume 7271, Computational Social Systems and the Internet (2007)
Birgit Heydenreich, Rudolf Müller, Marc Uetz, and Rakesh Vohra. On Revenue Equivalence in Truthful Mechanisms. In Computational Social Systems and the Internet. Dagstuhl Seminar Proceedings, Volume 7271, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{heydenreich_et_al:DagSemProc.07271.11, author = {Heydenreich, Birgit and M\"{u}ller, Rudolf and Uetz, Marc and Vohra, Rakesh}, title = {{On Revenue Equivalence in Truthful Mechanisms}}, booktitle = {Computational Social Systems and the Internet}, pages = {1--4}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07271.11}, URN = {urn:nbn:de:0030-drops-11581}, doi = {10.4230/DagSemProc.07271.11}, annote = {Keywords: Mechanism Design, Revenue Equivalence, Graph Theory} }
Feedback for Dagstuhl Publishing