English
Related papers

Related papers: Bribeproof mechanisms for two-values domains

200 papers

We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals. For instance, one goal is to make sure that a given pair of agents is matched in a stable…

Computer Science and Game Theory · Computer Science 2021-08-23 Niclas Boehmer , Robert Bredereck , Klaus Heeger , Rolf Niedermeier

Clearly, socio-economic freedom requires some extent of transparency regarding the implications of choices. In this paper, we review some established mechanisms for achieving such transparency, without any claim to completeness, and briefly…

Computers and Society · Computer Science 2016-06-16 Philipp Geiger

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

The aim of this paper is to establish a theory of random variables on domains. Domain theory is a fundamental component of theoretical computer science, providing mathematical models of computational processes. Random variables are the…

Logic in Computer Science · Computer Science 2016-08-30 Michael W. Mislove

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. Despite the simplicity of this…

Machine Learning · Computer Science 2024-02-20 Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni , Federico Fusco , Stefano Leonardi

We present the method of moments approach to pricing barrier-type options when the underlying is modelled by a general class of jump diffusions. By general principles the option prices are linked to certain infinite dimensional linear…

Computational Finance · Quantitative Finance 2008-12-25 Bjorn Eriksson , Martijn Pistorius

This study develops a framework for testing hypotheses on structural parameters in incomplete models. Such models make set-valued predictions and hence do not generally yield a unique likelihood function. The model structure, however,…

Econometrics · Economics 2019-12-03 Hiroaki Kaido , Yi Zhang

Recent work has constructed economic mechanisms that are both truthful and differentially private. In these mechanisms, privacy is treated separately from the truthfulness; it is not incorporated in players' utility functions (and doing so…

Computer Science and Game Theory · Computer Science 2012-11-14 Yiling Chen , Stephen Chong , Ian A. Kash , Tal Moran , Salil Vadhan

We define and investigate a property of mechanisms that we call "strategic simplicity," and that is meant to capture the idea that, in strategically simple mechanisms, strategic choices require limited strategic sophistication. We define a…

Theoretical Economics · Economics 2018-12-04 Tilman Borgers , Jiangtao Li

In discrete time markets with proportional transaction costs, Schachermayer (2004) shows that robust no-arbitrage is equivalent to the existence of a strictly consistent price system. In this paper, we introduce the concept of prospective…

Mathematical Finance · Quantitative Finance 2019-09-24 Christoph Kühn , Alexander Molitor

This paper studies models in which hypothesis tests have trivial power, that is, power smaller than size. This testing impossibility, or impossibility type A, arises when any alternative is not distinguishable from the null. We also study…

Statistics Theory · Mathematics 2020-02-19 Marinho Bertanha , Marcelo J. Moreira

In a strategy-proof mechanism, the influence of an agent may be measured as the set of outcomes an agent can bring about by varying her (reported) type. More specifically, we refer to an agent's influence on her own relevant outcomes as her…

Theoretical Economics · Economics 2025-12-12 Christian Basteck , Ulysse Lojkine

We study auction design in the celebrated interdependence model introduced by Milgrom and Weber [1982], where a mechanism designer allocates a good, maximizing the value of the agent who receives it, while inducing truthfulness using…

Computer Science and Game Theory · Computer Science 2026-03-20 Patrick Loiseau , Simon Mauras , Minrui Xu

We study dynamic mechanism design in a pure-exchange economy with privately observed idiosyncratic income. In the standard infinitely lived hidden-income benchmark of Green (1987) and Thomas-Worrall (1990), constrained-efficient allocations…

Theoretical Economics · Economics 2026-03-18 Michiko Ogaku

Over time, cryptographically deniable systems have come to be associated in computer-science literature with the idea of "denying" evidence in court - specifically, with the ability to convincingly forge evidence in courtroom scenarios and…

Cryptography and Security · Computer Science 2026-01-27 Jacob Leiken , Sunoo Park

Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is (1) public-key, meaning…

Quantum Physics · Physics 2012-09-18 Scott Aaronson , Paul Christiano

We reconsider the concept of multi-prover commitments, as introduced in the late eighties in the seminal work by Ben-Or et al. As was recently shown by Cr\'{e}peau et al., the security of known two-prover commitment schemes not only relies…

Quantum Physics · Physics 2015-05-13 Serge Fehr , Max Fillinger

Most work in mechanism design assumes that buyers are risk neutral; some considers risk aversion arising due to a non-linear utility for money. Yet behavioral studies have established that real agents exhibit risk attitudes which cannot be…

Computer Science and Game Theory · Computer Science 2018-03-13 Shuchi Chawla , Kira Goldner , J. Benjamin Miller , Emmanouil Pountourakis

Bribery in elections is an important problem in computational social choice theory. However, bribery with money is often illegal in elections. Motivated by this, we introduce the notion of frugal bribery and formulate two new pertinent…

Artificial Intelligence · Computer Science 2017-03-01 Palash Dey , Neeldhara Misra , Y. Narahari

We consider one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ either refers to the wining probability of an object or a share of a good, and $t$ denotes the payment that the buyer makes. We define…

Computer Science and Game Theory · Computer Science 2024-10-25 Mridu Prabal Goswami
‹ Prev 1 4 5 6 7 8 10 Next ›