4 Search Results for "Schwarz, Thomas"

Document
DOI: 10.4230/LIPIcs.AFT.2023.30
Time Is Money: Strategic Timing Games in Proof-Of-Stake Protocols

Authors: Caspar Schwarz-Schilling, Fahad Saleh, Thomas Thiery, Jennifer Pan, Nihar Shah, and Barnabé Monnot

Published in: LIPIcs, Volume 282, 5th Conference on Advances in Financial Technologies (AFT 2023)

Abstract
We propose a model suggesting that rational consensus participants may play timing games, and strategically delay their block proposal to optimize MEV capture, while still ensuring the proposal’s inclusion in the canonical chain. In this context, ensuring economic fairness among consensus participants is critical to preserving decentralization. We contend that a model grounded in rational consensus participation provides a more accurate portrayal of behavior in economically incentivized systems such as blockchain protocols. We empirically investigate timing games on the Ethereum network and demonstrate that while timing games are worth playing, they are not currently being exploited by consensus participants. By quantifying the marginal value of time, we uncover strong evidence pointing towards their future potential, despite the limited exploitation of MEV capture observed at present.
Cite as

Caspar Schwarz-Schilling, Fahad Saleh, Thomas Thiery, Jennifer Pan, Nihar Shah, and Barnabé Monnot. Time Is Money: Strategic Timing Games in Proof-Of-Stake Protocols. In 5th Conference on Advances in Financial Technologies (AFT 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 282, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{schwarzschilling_et_al:LIPIcs.AFT.2023.30,
  author =	{Schwarz-Schilling, Caspar and Saleh, Fahad and Thiery, Thomas and Pan, Jennifer and Shah, Nihar and Monnot, Barnab\'{e}},
  title =	{{Time Is Money: Strategic Timing Games in Proof-Of-Stake Protocols}},
  booktitle =	{5th Conference on Advances in Financial Technologies (AFT 2023)},
  pages =	{30:1--30:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-303-4},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{282},
  editor =	{Bonneau, Joseph and Weinberg, S. Matthew},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2023.30},
  URN =		{urn:nbn:de:0030-drops-192193},
  doi =		{10.4230/LIPIcs.AFT.2023.30},
  annote =	{Keywords: blockchain, proof-of-stake, game theory, maximal extractable value}
}
Document
Brief Announcement
DOI: 10.4230/LIPIcs.DISC.2017.51
Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks

Authors: Matthias Függer, Thomas Nowak, and Manfred Schwarz

Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)

Abstract
In this work we study the performance of asymptotic and approximate consensus algorithms in dynamic networks. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value within the convex hull of initial values. This problem, and the related approximate consensus problem, are fundamental building blocks in distributed systems where exact consensus among agents is not required, e.g., man-made distributed control systems, and have applications in the analysis of natural distributed systems, such as flocking and opinion dynamics. We prove new nontrivial lower bounds on the contraction rates of asymptotic consensus algorithms, from which we deduce lower bounds on the time complexity of approximate consensus algorithms. In particular, the obtained bounds show optimality of asymptotic and approximate consensus algorithms presented in [Charron-Bost et al., ICALP'16] for certain classes of networks that include classical failure assumptions, and confine the search for optimal bounds in the general case. Central to our lower bound proofs is an extended notion of valency, the set of reachable limits of an asymptotic consensus algorithm starting from a given configuration. We further relate topological properties of valencies to the solvability of exact consensus, shedding some light on the relation of these three fundamental problems in dynamic networks.
Cite as

Matthias Függer, Thomas Nowak, and Manfred Schwarz. Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 51:1-51:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{fugger_et_al:LIPIcs.DISC.2017.51,
  author =	{F\"{u}gger, Matthias and Nowak, Thomas and Schwarz, Manfred},
  title =	{{Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks}},
  booktitle =	{31st International Symposium on Distributed Computing (DISC 2017)},
  pages =	{51:1--51:3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-053-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{91},
  editor =	{Richa, Andr\'{e}a},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.51},
  URN =		{urn:nbn:de:0030-drops-79921},
  doi =		{10.4230/LIPIcs.DISC.2017.51},
  annote =	{Keywords: Asymptotic Consensus, Dynamic Networks, Contraction Rate, Time Commplexity, Lower Bounds}
}
Document
DOI: 10.4230/DagSemProc.04441.7
04441 Working Group – Research Issues in Mobile Transactions

Authors: Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Evaggelia Pitoura, Peter Reiher, George Samaras, Thomas Schwarz, and Can Türker

Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)

Abstract
This document discusses three scenarios for databases with mobile clients, summarizes typical applications and requirements for each of the three scenarios, and outlines the open research issues which should be solved within each of the three scenarios. While the first scenario consists of mobile clients that are connect to a wired network, the second scenario consists of a network of mobile clients with a single-hop distance to each other but without a wired network, and the third scenario considers a network of mobile clients some of which are in multi-hop distance.
Cite as

Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Evaggelia Pitoura, Peter Reiher, George Samaras, Thomas Schwarz, and Can Türker. 04441 Working Group – Research Issues in Mobile Transactions. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bose_et_al:DagSemProc.04441.7,
  author =	{B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Gruenwald, Le and Pitoura, Evaggelia and Reiher, Peter and Samaras, George and Schwarz, Thomas and T\"{u}rker, Can},
  title =	{{04441 Working Group – Research Issues in Mobile Transactions}},
  booktitle =	{Mobile Information Management},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4441},
  editor =	{Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.7},
  URN =		{urn:nbn:de:0030-drops-1685},
  doi =		{10.4230/DagSemProc.04441.7},
  annote =	{Keywords: Transactions , mobile clients , multi-hop wireless networks}
}
Document
DOI: 10.4230/DagSemProc.04441.8
04441 Working Group – Towards a Handbook for User-Centred Mobile Application Design

Authors: Susanne Boll, Martin Breunig, Nigel Davies, Christian S. Jensen, Birgitta König-Ries, Rainer Malaka, Florian Matthes, Christoforos Panayiotou, Simonas Saltenis, and Thomas Schwarz

Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)

Abstract
Why do we have difficulties designing mobile apps? Is there a "Mobile RUP"?
Cite as

Susanne Boll, Martin Breunig, Nigel Davies, Christian S. Jensen, Birgitta König-Ries, Rainer Malaka, Florian Matthes, Christoforos Panayiotou, Simonas Saltenis, and Thomas Schwarz. 04441 Working Group – Towards a Handbook for User-Centred Mobile Application Design. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{boll_et_al:DagSemProc.04441.8,
  author =	{Boll, Susanne and Breunig, Martin and Davies, Nigel and Jensen, Christian S. and K\"{o}nig-Ries, Birgitta and Malaka, Rainer and Matthes, Florian and Panayiotou, Christoforos and Saltenis, Simonas and Schwarz, Thomas},
  title =	{{04441 Working Group – Towards a Handbook for User-Centred Mobile Application Design}},
  booktitle =	{Mobile Information Management},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4441},
  editor =	{Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.8},
  URN =		{urn:nbn:de:0030-drops-1662},
  doi =		{10.4230/DagSemProc.04441.8},
  annote =	{Keywords: User-Centred Mobile Application Design}
}
  • Refine by Author
  • 2 Schwarz, Thomas
  • 1 Boll, Susanne
  • 1 Breunig, Martin
  • 1 Böse, Joos-Hendrik
  • 1 Böttcher, Stefan
  • Show More...

  • Refine by Classification
  • 1 Theory of computation → Algorithmic game theory and mechanism design

  • Refine by Keyword
  • 1 Asymptotic Consensus
  • 1 Contraction Rate
  • 1 Dynamic Networks
  • 1 Lower Bounds
  • 1 Time Commplexity
  • Show More...

  • Refine by Type
  • 4 document

  • Refine by Publication Year
  • 2 2005
  • 1 2017
  • 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