6 Search Results for "H�ns, Robin"


Document
Condorcet-Consistent and Approximately Strategyproof Tournament Rules

Authors: Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg

Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)


Abstract
We consider the manipulability of tournament rules for round-robin tournaments of n competitors. Specifically, n competitors are competing for a prize, and a tournament rule r maps the result of all n(n-1)/2 pairwise matches (called a tournament, T) to a distribution over winners. Rule r is Condorcet-consistent if whenever i wins all n-1 of her matches, r selects i with probability 1. We consider strategic manipulation of tournaments where player j might throw their match to player i in order to increase the likelihood that one of them wins the tournament. Regardless of the reason why j chooses to do this, the potential for manipulation exists as long as Pr[r(T) = i] increases by more than Pr[r(T) = j] decreases. Unfortunately, it is known that every Condorcet-consistent rule is manipulable. In this work, we address the question of how manipulable Condorcet-consistent rules must necessarily be - by trying to minimize the difference between the increase in Pr[r(T) = i] and decrease in Pr[r(T) = j] for any potential manipulating pair. We show that every Condorcet-consistent rule is in fact 1/3-manipulable, and that selecting a winner according to a random single elimination bracket is not alpha-manipulable for any alpha > 1/3. We also show that many previously studied tournament formats are all 1/2-manipulable, and the popular class of Copeland rules (any rule that selects a player with the most wins) are all in fact 1-manipulable, the worst possible. Finally, we consider extensions to match-fixing among sets of more than two players.

Cite as

Jon Schneider, Ariel Schvartzman, and S. Matthew Weinberg. Condorcet-Consistent and Approximately Strategyproof Tournament Rules. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 35:1-35:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@InProceedings{schneider_et_al:LIPIcs.ITCS.2017.35,
  author =	{Schneider, Jon and Schvartzman, Ariel and Weinberg, S. Matthew},
  title =	{{Condorcet-Consistent and Approximately Strategyproof Tournament Rules}},
  booktitle =	{8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
  pages =	{35:1--35:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-029-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{67},
  editor =	{Papadimitriou, Christos H.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.35},
  URN =		{urn:nbn:de:0030-drops-81605},
  doi =		{10.4230/LIPIcs.ITCS.2017.35},
  annote =	{Keywords: Tournament design, Non-manipulability, Condorcet-consistent, Strategyproofness}
}
Document
Separating Quantum Communication and Approximate Rank

Authors: Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee

Published in: LIPIcs, Volume 79, 32nd Computational Complexity Conference (CCC 2017)


Abstract
One of the best lower bound methods for the quantum communication complexity of a function H (with or without shared entanglement) is the logarithm of the approximate rank of the communication matrix of H. This measure is essentially equivalent to the approximate gamma-2 norm and generalized discrepancy, and subsumes several other lower bounds. All known lower bounds on quantum communication complexity in the general unbounded-round model can be shown via the logarithm of approximate rank, and it was an open problem to give any separation at all between quantum communication complexity and the logarithm of the approximate rank. In this work we provide the first such separation: We exhibit a total function H with quantum communication complexity almost quadratically larger than the logarithm of its approximate rank. We construct H using the communication lookup function framework of Anshu et al. (FOCS 2016) based on the cheat sheet framework of Aaronson et al. (STOC 2016). From a starting function F, this framework defines a new function H=F_G. Our main technical result is a lower bound on the quantum communication complexity of F_G in terms of the discrepancy of F, which we do via quantum information theoretic arguments. We show the upper bound on the approximate rank of F_G by relating it to the Boolean circuit size of the starting function F.

Cite as

Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. Separating Quantum Communication and Approximate Rank. In 32nd Computational Complexity Conference (CCC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 79, pp. 24:1-24:33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@InProceedings{anshu_et_al:LIPIcs.CCC.2017.24,
  author =	{Anshu, Anurag and Ben-David, Shalev and Garg, Ankit and Jain, Rahul and Kothari, Robin and Lee, Troy},
  title =	{{Separating Quantum Communication and Approximate Rank}},
  booktitle =	{32nd Computational Complexity Conference (CCC 2017)},
  pages =	{24:1--24:33},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-040-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{79},
  editor =	{O'Donnell, Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2017.24},
  URN =		{urn:nbn:de:0030-drops-75303},
  doi =		{10.4230/LIPIcs.CCC.2017.24},
  annote =	{Keywords: Communication Complexity, Quantum Computing, Lower Bounds, logrank, Quantum Information}
}
Document
Randomized Query Complexity of Sabotaged and Composed Functions

Authors: Ben-David Shalev and Robin Kothari

Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)


Abstract
We study the composition question for bounded-error randomized query complexity: Is R(f circ g) = Omega(R(f)R(g))? We show that inserting a simple function h, whose query complexity is onlyTheta(log R(g)), in between f and g allows us to prove R(f circ h circ g) = Omega(R(f)R(h)R(g)). We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f circ g) >= RS(f) RS(g), and a composition theorem with randomized query complexity, R(f circ g) = Omega(R(f) RS(g)). It is also a quadratically tight lower bound for total functions and can be quadratically superior to the partition bound, the best known general lower bound for randomized query complexity. Using this technique we also show implications for lifting theorems in communication complexity. We show that a general lifting theorem from zero-error randomized query to communication complexity implies a similar result for bounded-error algorithms for all total functions.

Cite as

Ben-David Shalev and Robin Kothari. Randomized Query Complexity of Sabotaged and Composed Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{shalev_et_al:LIPIcs.ICALP.2016.60,
  author =	{Shalev, Ben-David and Kothari, Robin},
  title =	{{Randomized Query Complexity of Sabotaged and Composed Functions}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{60:1--60:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60},
  URN =		{urn:nbn:de:0030-drops-62233},
  doi =		{10.4230/LIPIcs.ICALP.2016.60},
  annote =	{Keywords: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem}
}
Document
Exploiting Domain-Specific Structures For End-User Programming Support Tools

Authors: Robin Abraham and Martin Erwig

Published in: Dagstuhl Seminar Proceedings, Volume 7081, End-User Software Engineering (2007)


Abstract
In previous work we have tried to transfer ideas that have been successful in general-purpose programming languages and mainstream software engineering into the realm of spreadsheets, which is one important example of an end-user programming environment. More specifically, we have addressed the questions of how to employ the concepts of type checking, program generation and maintenance, and testing in spreadsheets. While the primary objective of our work has been to offer improvements for end-user productivity, we have tried to follow two particular principles to guide our research. (1) Keep the number of new concepts to be learned by end users at a minimum. (2) Exploit as much as possible information offered by the internal structure of spreadsheets. In this short paper we will illustrate our research approach with several examples.

Cite as

Robin Abraham and Martin Erwig. Exploiting Domain-Specific Structures For End-User Programming Support Tools. In End-User Software Engineering. Dagstuhl Seminar Proceedings, Volume 7081, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{abraham_et_al:DagSemProc.07081.16,
  author =	{Abraham, Robin and Erwig, Martin},
  title =	{{Exploiting Domain-Specific Structures For End-User Programming Support Tools}},
  booktitle =	{End-User Software Engineering},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7081},
  editor =	{Margaret H. Burnett and Gregor Engels and Brad A. Myers and Gregg Rothermel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07081.16},
  URN =		{urn:nbn:de:0030-drops-10862},
  doi =		{10.4230/DagSemProc.07081.16},
  annote =	{Keywords: Spreadsheet, program analysis}
}
Document
The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle

Authors: Heinz Mühlenbein and Robin Höns

Published in: Dagstuhl Seminar Proceedings, Volume 6061, Theory of Evolutionary Algorithms (2006)


Abstract
We assume that the function to be optimized is additively decomposed (ADF). Then the interaction graph $G_{ADF}$ can be used to compute exact or approximate factorizations. For many practical problems only approximate factorizations lead to efficient optimization algorithms. The relation between the approximation used by the FDA algorithm and the minimum relative entropy principle is discussed. A new algorithm is presented, derived from the Bethe-Kikuchi approach in statistical physics. It minimizes the relative entropy to a Boltzmann distribution with fixed $eta$. We shortly compare different factorizations and algorithms within the FDA software. We use 2-d Ising spin glass problems and Kaufman's n-k function as examples.

Cite as

Heinz Mühlenbein and Robin Höns. The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. In Theory of Evolutionary Algorithms. Dagstuhl Seminar Proceedings, Volume 6061, pp. 1-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Copy BibTex To Clipboard

@InProceedings{muhlenbein_et_al:DagSemProc.06061.9,
  author =	{M\"{u}hlenbein, Heinz and H\"{o}ns, Robin},
  title =	{{The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle}},
  booktitle =	{Theory of Evolutionary Algorithms},
  pages =	{1--27},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6061},
  editor =	{Dirk V. Arnold and Thomas Jansen and Michael D. Vose and Jonathan E. Rowe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06061.9},
  URN =		{urn:nbn:de:0030-drops-5973},
  doi =		{10.4230/DagSemProc.06061.9},
  annote =	{Keywords: Junction tree, minimum relative entropy, maximum likelihood, Bethe-Kikuchi approximation}
}
Document
Auxiliary relations and sandwich theorems

Authors: Chris God, Achim Jung, Robin Knight, and Ralph Kopperman

Published in: Dagstuhl Seminar Proceedings, Volume 4351, Spatial Representation: Discrete vs. Continuous Computational Models (2005)


Abstract
A well-known topological theorem due to Kat\v etov states: Suppose $(X,\tau)$ is a normal topological space, and let $f:X\to[0,1]$ be upper semicontinuous, $g:X\to[0,1]$ be lower semicontinuous, and $f\leq g$. Then there is a continuous $h:X\to[0,1]$ such that $f\leq h\leq g$. We show a version of this theorem for many posets with auxiliary relations. In particular, if $P$ is a Scott domain and $f,g:P\to[0,1]$ are such that $f\leq g$, and $f$ is lower continuous and $g$ Scott continuous, then for some $h$, $f\leq h\leq g$ and $h$ is both Scott and lower continuous. As a result, each Scott continuous function from $P$ to $[0,1]$, is the sup of the functions below it which are both Scott and lower continuous.

Cite as

Chris God, Achim Jung, Robin Knight, and Ralph Kopperman. Auxiliary relations and sandwich theorems. In Spatial Representation: Discrete vs. Continuous Computational Models. Dagstuhl Seminar Proceedings, Volume 4351, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{god_et_al:DagSemProc.04351.8,
  author =	{God, Chris and Jung, Achim and Knight, Robin and Kopperman, Ralph},
  title =	{{Auxiliary relations and sandwich theorems}},
  booktitle =	{Spatial Representation: Discrete vs. Continuous Computational Models},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4351},
  editor =	{Ralph Kopperman and Michael B. Smyth and Dieter Spreen and Julian Webster},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04351.8},
  URN =		{urn:nbn:de:0030-drops-1348},
  doi =		{10.4230/DagSemProc.04351.8},
  annote =	{Keywords: Adjoint , auxiliary relation , continuous poset , pairwise completely regular (and pairwise normal) bitopological space , upper (lower) semicontinuous Urysohn relation}
}
  • Refine by Author
  • 2 Kothari, Robin
  • 1 Abraham, Robin
  • 1 Anshu, Anurag
  • 1 Ben-David, Shalev
  • 1 Erwig, Martin
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Adjoint
  • 1 Bethe-Kikuchi approximation
  • 1 Communication Complexity
  • 1 Condorcet-consistent
  • 1 Junction tree
  • Show More...

  • Refine by Type
  • 6 document

  • Refine by Publication Year
  • 2 2017
  • 1 2005
  • 1 2006
  • 1 2007
  • 1 2016

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