English
Related papers

Related papers: Sequential Veto Bargaining with Incomplete Informa…

200 papers

In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…

Computer Science and Game Theory · Computer Science 2025-11-10 Jonathan Shaki , Jiarui Gan , Sarit Kraus

A seller with one unit of a good faces N\geq3 buyers and a single competitor who sells one other identical unit in a second-price auction with a reserve price. Buyers who do not get the seller's good will compete in the competitor's…

Theoretical Economics · Economics 2021-10-26 Kenneth Hendricks , Thomas Wiseman

We introduce a stochastic principal-agent model. A principal and an agent interact in a stochastic environment, each privy to observations about the state not available to the other. The principal has the power of commitment, both to elicit…

Computer Science and Game Theory · Computer Science 2024-09-13 Jiarui Gan , Rupak Majumdar , Debmalya Mandal , Goran Radanovic

We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction…

Computer Science and Game Theory · Computer Science 2016-09-15 Stéphane Le Roux , Arno Pauly

We study the selection of agents based on mutual nominations, a theoretical problem with many applications from committee selection to AI alignment. As agents both select and are selected, they may be incentivized to misrepresent their true…

Computer Science and Game Theory · Computer Science 2025-10-23 Javier Cembrano , Felix Fischer , Max Klimm

We study the problem of agent-based negotiation in combinatorial domains. It is difficult to reach optimal agreements in bilateral or multi-lateral negotiations when the agents' preferences for the possible alternatives are not common…

Artificial Intelligence · Computer Science 2012-02-20 Minyi Li , Quoc Bao Vo , Ryszard Kowalczyk

We study a class of finite-action disclosure games in which the sender's preferences are state-independent and the receiver's optimal action depends only on the expected state. While receiver-preferred equilibria in these games involve full…

Theoretical Economics · Economics 2026-05-06 Denis Shishkin , Maria Titova , Kun Zhang

Seed fundraising for ventures often takes place by sequentially approaching potential contributors, who make observable decisions. The fundraising succeeds when a target number of investments is reached. Though resembling classic…

Computer Science and Game Theory · Computer Science 2021-12-15 Amir Ban , Moran Koren

We propose a sequential optimizing betting strategy in the multi-dimensional bounded forecasting game in the framework of game-theoretic probability of Shafer and Vovk (2001). By studying the asymptotic behavior of its capital process, we…

Probability · Mathematics 2011-02-16 Masayuki Kumon , Akimichi Takemura , Kei Takeuchi

Limited lookahead has been studied for decades in perfect-information games. We initiate a new direction via two simultaneous deviation points: generalization to imperfect-information games and a game-theoretic approach. We study how one…

Computer Science and Game Theory · Computer Science 2020-03-20 Christian Kroer , Tuomas Sandholm

We study settings in which agents with incomplete preferences need to make a collective decision. We focus on a process of majority dynamics where issues are addressed one at a time and undecided agents follow the opinion of the majority.…

Computer Science and Game Theory · Computer Science 2022-05-03 Sirin Botan , Simon Rey , Zoi Terzopoulou

In the classical Bayesian persuasion model an informed player and an uninformed one engage in a static interaction. The informed player, the sender, knows the state of nature, while the uninformed one, the receiver, does not. The informed…

Theoretical Economics · Economics 2021-11-30 Ehud Lehrer , Dimitry Shaiderman

We study a dynamic sender-receiver game in which the sender observes a state evolving according to a Markov chain but does not observe the receiver's action. Despite the absence of feedback, dynamic interaction partially restores…

Theoretical Economics · Economics 2026-04-30 Atulya Jain

Quadratic Voting (QV) is a social choice mechanism that addresses the "tyranny of the majority" of one-person-one-vote mechanisms. Agents express not only their preference ordering but also their preference intensity by purchasing $x$ votes…

Computer Science and Game Theory · Computer Science 2024-09-11 Laura Georgescu , James Fox , Anna Gautier , Michael Wooldridge

We analyze how dynamic information should be provided to uniquely implement the largest equilibrium in binary-action coordination games. The designer offers an informational put: she stays silent if players choose her preferred action, but…

Theoretical Economics · Economics 2024-12-31 Andrew Koh , Sivakorn Sanguanmoo , Kei Uzui

This paper presents a comprehensive analytical study of two competitive cognitive operators' spectrum leasing and pricing strategies, taking into account operators' heterogeneity in leasing costs and users' heterogeneity in transmission…

Networking and Internet Architecture · Computer Science 2016-11-17 Lingjie Duan , Jianwei Huang , Biying Shou

We formulate and study a general time-varying multi-agent system where players repeatedly compete under incomplete information. Our work is motivated by scenarios commonly observed in online advertising and retail marketplaces, where agents…

Computer Science and Game Theory · Computer Science 2025-05-27 Ludovico Crippa , Yonatan Gur , Bar Light

This paper studies a game in which an informed sender with state-independent preferences uses verifiable messages to convince a receiver to choose an action from a finite set. We characterize the equilibrium outcomes of the game and compare…

Theoretical Economics · Economics 2025-10-10 Maria Titova , Kun Zhang

We study a dynamic Bayesian persuasion model called Markovian persuasion. In such a model, the belief of the receiver regarding the current state of a Markov chain $(X_n)_{n\geq 1}$, over a finite state space $K$, is controlled through…

Optimization and Control · Mathematics 2025-12-09 Dimitry Shaiderman

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player…

Optimization and Control · Mathematics 2015-09-14 Fabien Gensbittel