English
Related papers

Related papers: Ex-post implementation with interdependent values

200 papers

We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the…

Databases · Computer Science 2024-07-23 Michael Benedikt , Stanislav Kikot , Johannes Marti , Piotr Ostropolski-Nalewaja

We study existence, uniqueness and computability of solutions for a class of discrete time recursive utilities models. By combining two streams of the recent literature on recursive preferences---one that analyzes principal eigenvalues of…

Economics · Quantitative Finance 2019-04-24 Jaroslav Borovicka , John Stachurski

We characterize incentive compatible mechanisms in environments with hidden types and flexible hidden actions. Our approach introduces extended recommendation schedules that specify prescribed actions also off-path, after misreports. This…

Theoretical Economics · Economics 2025-09-16 Henrique Castro-Pires , Deniz Kattwinkel , Jan Knoepfle

Variational inequality problems allow for capturing an expansive class of problems, including convex optimization problems, convex Nash games and economic equilibrium problems, amongst others. Yet in most practical settings, such problems…

Optimization and Control · Mathematics 2017-02-17 Uma V. Ravat , Uday V. Shanbhag

When multiple informative equilibria are possible in a general cheap talk game, how much information can a principal guarantee herself? To answer this question, I define the notion of worst-case implementation-implementation via the worst…

Theoretical Economics · Economics 2026-02-17 Andrei Iakovlev

In an incomplete Brownian-motion market setting, we propose a convex monotonic pricing functional for nonattainable bounded contingent claims which is compatible with prices for attainable claims. The pricing functional is defined as the…

Pricing of Securities · Quantitative Finance 2008-12-18 Johannes Leitner

We study the problem of fairly allocating a set of $m$ indivisible goods to a set of $n$ agents. Envy-freeness up to any good (EFX) criteria -- which requires that no agent prefers the bundle of another agent after removal of any single…

Computer Science and Game Theory · Computer Science 2022-08-11 Hannaneh Akrami , Rojin Rezvan , Masoud Seddighin

We study revenue maximization in settings where agents' values are interdependent: each agent receives a signal drawn from a correlated distribution and agents' values are functions of all of the signals. We introduce a variant of the…

Computer Science and Game Theory · Computer Science 2014-08-20 Shuchi Chawla , Hu Fu , Anna Karlin

We study the asymptotic average-case efficiency of static and anonymous posted prices for $n$ agents and $m(n)$ multiple identical items with $m(n)=o\left(\frac{n}{\log n}\right)$. When valuations are drawn i.i.d from some fixed continuous…

Computer Science and Game Theory · Computer Science 2019-01-09 Urban Larsson , Ron Lavi

We investigate \emph{bi-valued} auctions in the digital good setting and construct an explicit polynomial time deterministic auction. We prove an unconditional tight lower bound which holds even for random superpolynomial auctions. The…

Data Structures and Algorithms · Computer Science 2011-06-24 Oren Ben-Zwi , Ilan Newman

The efficient market hypothesis (EMH) famously stated that prices fully reflect the information available to traders. This critically depends on the transfer of information into prices through trading strategies. Traders optimise their…

Mathematical Finance · Quantitative Finance 2025-01-14 Paolo Barucca , Flaviano Morone

We study the fair allocation problem of indivisible items with subsidy. In this paper, we focus on the notion of fairness - equitability (EQ), which requires that items be allocated such that all agents value the bundle they receive…

Computer Science and Game Theory · Computer Science 2025-09-10 Yuanyuan Wang , Tianze Wei

The EM (Expectation-Maximization) algorithm is regarded as an MM (Majorization-Minimization) algorithm for maximum likelihood estimation of statistical models. Expanding this view, this paper demonstrates that by choosing an appropriate…

Optimization and Control · Mathematics 2026-02-12 Kensuke Asai , Jun-ya Gotoh

The Empirical Revenue Maximization (ERM) is one of the most important price learning algorithms in auction design: as the literature shows it can learn approximately optimal reserve prices for revenue-maximizing auctioneers in both repeated…

Computer Science and Game Theory · Computer Science 2020-10-13 Xiaotie Deng , Ron Lavi , Tao Lin , Qi Qi , Wenwei Wang , Xiang Yan

Structural results impose sufficient conditions on the model parameters of a Markov decision process (MDP) so that the optimal policy is an increasing function of the underlying state. The classical assumptions for MDP structural results…

Systems and Control · Electrical Eng. & Systems 2023-03-07 Vikram Krishnamurthy

We study the design of information acquisition games-environments where a designer contracts their action on Sender's choice of experiment and the realized signals about some state-and identify which predictions can be made absent knowledge…

Theoretical Economics · Economics 2026-01-22 Eric Gao , Daniel Luo

We propose a general approximation method for determining optimal trading strategies in markets with proportional transaction costs, with a polynomial approximation of the residual value function. The method is exemplified by several…

Portfolio Management · Quantitative Finance 2024-07-11 Eberhard Mayerhofer

Income- and price-elasticity of demand quantify the responsiveness of markets to changes in income, and in prices, respectively. Under the assumptions of utility maximization and preference-independence (additive preferences), mathematical…

Applications · Statistics 2016-04-27 Lorenzo Sabatelli

We study the problem of allocating a group of indivisible chores among agents while each chore has a binary marginal. We focus on the fairness criteria of envy-freeness up to any item (EFX) and investigate the existence of EFX allocations.…

Computer Science and Game Theory · Computer Science 2023-08-24 Biaoshuai Tao , Xiaowei Wu , Ziqi Yu , Shengwei Zhou

We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine whether or not they satisfy the…

Optimization and Control · Mathematics 2011-10-11 Pavel Chebotarev , Elena Shamis