#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2009

2017

- This year (2)
- Last 5 years (15)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Felix Brandt, Maria Chudnovsky, +5 authors Stéphan Thomassé
- Social Choice and Welfare
- 2013

In 1990, motivated by applications in the social sciences, Thomas Schwartz made a conjecture about tournaments which would have had numerous attractive consequences. In particular, it implied that there is no tournament with a partition A, B of its vertex set, such that every transitive subset of A is in the out-neighbour set of some vertex in B, and vice… (More)

- Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
- APPROX-RANDOM
- 2015

We prove that for any constant k and any < 1, there exist bimatrix win-lose games for which every-WSNE requires supports of cardinality greater than k. To do this, we provide a graph-theoretic characterization of win-lose games that possess-WSNE with constant cardinality supports. We then apply a result in additive number theory of Haight [8] to construct… (More)

- Jan Hladký, Daniel Král, Sergey Norin
- Electronic Notes in Discrete Mathematics
- 2009

An important instance of the Caccetta-Häggkvist conjecture asserts that an n-vertex digraph with minimum outdegree at least n/3 contains a directed triangle. Improving on a previous bound of 0.3532n due to Hamburger, Haxell, and Kostochka we prove that a digraph with minimum outdegree at least 0.3465n contains a directed triangle. The proof is an… (More)

- Zdenek Dvorak, Sergey Norin
- SIAM J. Discrete Math.
- 2016

- Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta
- WINE
- 2013

In an-approximate Nash equilibrium, a player can gain at most in expectation by unilateral deviation. An-well-supported approximate Nash equilibrium has the stronger requirement that every pure strategy used with positive probability must have payoff within of the best response payoff. Daskalakis, Mehta and Papadimitriou [8] conjectured that every win-lose… (More)

- Nicolas Bousquet, Sergey Norin, Adrian Vetta
- WINE
- 2014

We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin [5] and Alon et al. [1]. Fisher and Klimm [4] showed that the permutation mechanism is impartial and 1 2-optimal, that is, it selects an agent who gains, in… (More)

- Zdenek Dvorak, Sergey Norin
- ArXiv
- 2014

We prove that if every subgraph of a graph G has a balanced separation of order at most a then G has treewidth at most 105a. This establishes a linear dependence between the treewidth and the separation number.

- Sergey Norin
- Surveys in Combinatorics
- 2015

- Maria Chudnovsky, Sergey Norin, Bruce A. Reed, Paul D. Seymour
- SIAM J. Discrete Math.
- 2015

Ramsey's theorem says that for every clique H 1 and for every graph H 2 with no edges, all graphs containing neither of H 1 , H 2 as induced subgraphs have bounded order. What if, instead, we exclude a graph H 1 with a vertex whose deletion gives a clique, and the complement H 2 of another such graph? This no longer implies bounded order, but it implies… (More)

- Endre Csóka, Irene Lo, Sergey Norin, Hehui Wu, Liana Yepremyan
- J. Comb. Theory, Ser. B
- 2017