#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2011

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andrzej Dudek, David Wajc
- Discrete Mathematics & Theoretical Computer…
- 2011

Given a graph G = (V, E) and a weight function w : E → R, a coloring of vertices of G, induced by w, is defined by χ w (v) = ev w(e) for all v ∈ V. In this paper, we show that determining whether a particular graph has a weighting of the edges from {1, 2} that induces a proper vertex coloring is NP-complete.

In many computational and economic models of multi-agent interaction, each participant repeatedly "best-responds" to the others' actions. Game theory research on the prominent "best-response dynamics" model typically relies on the premise that the interaction between agents is somehow synchronized. However, in many real-life settings, e.g., internet… (More)

- Joseph Naor, David Wajc
- EC
- 2015

Motivated by Internet targeted advertising, we address several ad allocation problems. Prior work has established these problems admit no randomized online algorithm better than (1-1/e)-competitive ([Karp et al. 1990; Mehta et al. 2007]), yet simple heuristics have been observed to perform much better in practice. We explain this phenomenon by studying a… (More)

- Iftah Gamzu, Zohar S. Karnin, Yoelle Maarek, David Wajc
- WWW
- 2015

- Bernhard Haeupler, David Wajc
- PODC
- 2016

We present a faster distributed broadcasting primitive for the classical radio network model.
The most basic distributed radio network broadcasting primitive - called Decay - dates back to a PODC'87 result of Bar-Yehuda, Goldreich, and Itai. In any radio network with some informed source nodes, running Decay for <i>O</i>(<i>d</i> log <i>n</i> +… (More)

- David Wajc
- 2017

- ‹
- 1
- ›