2 Search Results for "Meier, Robert"

Document
Short Paper
DOI: 10.4230/LIPIcs.GIScience.2023.21
Using the Dynamic Microsimulation MINOS to Evidence the Effect of Energy Crisis Income Support Policy (Short Paper)

Authors: Robert Clay, Luke Archer, Alison Heppenstall, and Nik Lomax

Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)

Abstract
Rates of anxiety and depression are increasing due to financial stress caused by energy pricing with over half of UK homes unable to afford comfortable heating. UK Government policies to address this energy crisis have been implemented with limited evidence and substantial criticism. This paper applies the dynamic microsimulation MINOS, which utilises longitudinal Understanding Society data, to evidence change in mental well-being under the Energy Price Cap Guarantee and Energy Bill Support Scheme Policies. Results demonstrate an overall improvement in Short Form 12 Mental Component Score (SF12-MCS) both on aggregate and over data zone spatial areas for the Glasgow City region compared with a baseline of no policy intervention. This is work in progress and discussion highlights potential future work in other energy policy areas, such as Net Zero.
Cite as

Robert Clay, Luke Archer, Alison Heppenstall, and Nik Lomax. Using the Dynamic Microsimulation MINOS to Evidence the Effect of Energy Crisis Income Support Policy (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 21:1-21:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{clay_et_al:LIPIcs.GIScience.2023.21,
  author =	{Clay, Robert and Archer, Luke and Heppenstall, Alison and Lomax, Nik},
  title =	{{Using the Dynamic Microsimulation MINOS to Evidence the Effect of Energy Crisis Income Support Policy}},
  booktitle =	{12th International Conference on Geographic Information Science (GIScience 2023)},
  pages =	{21:1--21:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-288-4},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{277},
  editor =	{Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.21},
  URN =		{urn:nbn:de:0030-drops-189160},
  doi =		{10.4230/LIPIcs.GIScience.2023.21},
  annote =	{Keywords: Dynamic Microsimulation, Mental Health, Energy Poverty}
}
Document
DOI: 10.4230/LIPIcs.ESA.2020.17
An Optimal Decentralized (Δ + 1)-Coloring Algorithm

Authors: Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Miloš Trujić, and Emo Welzl

Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)

Abstract
Consider the following simple coloring algorithm for a graph on n vertices. Each vertex chooses a color from {1, ..., Δ(G) + 1} uniformly at random. While there exists a conflicted vertex choose one such vertex uniformly at random and recolor it with a randomly chosen color. This algorithm was introduced by Bhartia et al. [MOBIHOC'16] for channel selection in WIFI-networks. We show that this algorithm always converges to a proper coloring in expected O(n log Δ) steps, which is optimal and proves a conjecture of Chakrabarty and de Supinski [SOSA'20].
Cite as

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Miloš Trujić, and Emo Welzl. An Optimal Decentralized (Δ + 1)-Coloring Algorithm. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bertschinger_et_al:LIPIcs.ESA.2020.17,
  author =	{Bertschinger, Daniel and Lengler, Johannes and Martinsson, Anders and Meier, Robert and Steger, Angelika and Truji\'{c}, Milo\v{s} and Welzl, Emo},
  title =	{{An Optimal Decentralized (\Delta + 1)-Coloring Algorithm}},
  booktitle =	{28th Annual European Symposium on Algorithms (ESA 2020)},
  pages =	{17:1--17:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-162-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{173},
  editor =	{Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.17},
  URN =		{urn:nbn:de:0030-drops-128837},
  doi =		{10.4230/LIPIcs.ESA.2020.17},
  annote =	{Keywords: Decentralized Algorithm, Distributed Computing, Graph Coloring, Randomized Algorithms}
}
  • Refine by Author
  • 1 Archer, Luke
  • 1 Bertschinger, Daniel
  • 1 Clay, Robert
  • 1 Heppenstall, Alison
  • 1 Lengler, Johannes
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Sociology
  • 1 Mathematics of computing → Graph algorithms
  • 1 Mathematics of computing → Graph coloring
  • 1 Mathematics of computing → Probabilistic algorithms
  • 1 Theory of computation → Distributed algorithms

  • Refine by Keyword
  • 1 Decentralized Algorithm
  • 1 Distributed Computing
  • 1 Dynamic Microsimulation
  • 1 Energy Poverty
  • 1 Graph Coloring
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2020
  • 1 2023

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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact