The paper studies bargaining games involving players with present-biased preferences. shows that the relative timing of rewards and costs will determine whether players’ present-bias affect outcomes. In cases where agree to a bargain in period 1 experience all payoffs 2, act time-consistent fashion. When time-inconsistent incur immediate produce delayed rewards, they have an incentive procrasti...

Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that allows a dealer to share a secret among n parties in the presence of an adversary controlling at most t of them. In the computational setting, the feasibility of VSS schemes based on commitments was established over two decades ago. Interestingly, all known computational VSS schemes rely on the homomorphi...

The coordination in open multi-agent systems is difficult to achieve, mainly because agents are autonomous. Social commitments have been proposed as a new coordination paradigm, suitable to describe agent communications or interactions. As some authors have pointed out, commitment enforcement is necessary, i.e., autonomous agents that violate commitments must be punished. In related work this i...

Past research has produced evidence that parsing commitments strengthen over the processing of additional linguistic elements that are consistent with the commitments and undoing strong commitments takes more time than undoing weak commitments. It remains unclear, however, whether this so-called digging-in effect is exclusively due to the length of an ambiguous region or at least partly to the ...

In face of pressure from politicians and constituents public agencies have to collaborate with each other to offer a one-stop shop. The emphasis shifts from vertical to horizontal coordination and integration, which requires the making of commitments between public agencies and the fulfillment of these commitments. Consequently accountability shifts from hierarchical to commitment-based account...

Non-malleable commitments are a central cryptographic primitive that guarantee security against man-in-the-middle adversaries, and their exact round complexity has been a subject of great interest. Pass (TCC 2013, CC 2016) proved that non-malleable commitments with respect to commitment are impossible to construct in less than three rounds, via black-box reductions to polynomial hardness assump...

In this paper we consider a transportation procurement auction consisting of shippers and carriers. Shippers offer time sensitive pickup and delivery jobs and carriers bid on these jobs. We focus on revenue maximizing strategies for shippers in sequential auctions. For this purpose we propose two strategies, namely delaying and breaking commitments. The idea of delaying commitments is that a sh...