VLDB 2026 Research / reviewers in the wild / expert
Jonathan Wagner
dblp:21/3862
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Strategy-proof budgeting via a VCG-like mechanismabstractWe present a strategy-proof public goods budgeting mechanism where agents determine both the total volume of expanses and the specific allocation. It is constructed as a modification of VCG to a non-typical environment, namely where we do not assume quasi-linear utilities nor direct revelation. We further show that under plausible assumptions it satisfies strategyproofness in strictly dominant strategies, and consequently implements the social optimum as a Coalition-Proof Nash Equilibrium. A primary (albeit not an exclusive) motivation of our model is Participatory Budgeting, where members of a community collectively decide the spending policy of public tax dollars. While incentives alignment in our mechanism, as in classic VCG, is achieved via individual payments we charge from agents, in a PB context that seems unreasonable. Our second main result thus provides that, under further specifications relevant in that context, these payments will vanish in large populations. In the last section we expand the mechanism’s definition to a class of mechanisms in which the designer can prioritize certain outcomes she sees as desirable. In particular we give the example of favoring equitable/egalitarian allocations. Jonathan Wagner, Reshef Meir |
Theor. Comput. Sci. | 1 |
| 2023 | Strategy-Proof Budgeting via a VCG-Like Mechanism
Jonathan Wagner, Reshef Meir |
SAGT | 1 |
| 2005 | Online resource matching for heterogeneous grid environmentsabstractIn this paper, we first present a linear programming based approach for modeling and solving the resource matching problem in grid environments with heterogeneous resources. The resource matching problem described takes into account resource sharing, job priorities, dependencies on multiple resource types, and resource specific policies. We then propose Web service style architecture for online matching of independent jobs with resources in a grid environment and describe a prototype implementation. Our preliminary performance results indicate that the linear programming based approach for resource matching is efficient in speed and accuracy and can keep up with high job arrival rates of an important criterion for online resource matching systems. Also, the Web service style architecture makes the system scalable and extendable. It can also be integrated with other existing grid services in a straightforward manner. Vijay K. Naik, Chuang Liu 0006, Lingyun Yang, Jonathan Wagner |
CCGRID | 4 |