English
Related papers

Related papers: Obvious Strategy-proofness with Respect to a Parti…

200 papers

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

Data regulations increasingly enable consumers to switch among market segments, making segmentation an endogenous outcome of strategic interaction. We study a model in which consumers choose segments before a monopolist sets…

Theoretical Economics · Economics 2026-05-14 Zhonghong Kuang , Sanxi Li , Yi Liu , Yang Yu

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

Proportionality is an attractive fairness concept that has been applied to a range of problems including the facility location problem, a classic problem in social choice. In our work, we propose a concept called Strong Proportionality,…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam , Mashbat Suzuki , Toby Walsh

Obvious strategyproofness (OSP) is an appealing concept as it allows to maintain incentive compatibility even in the presence of agents that are not fully rational, e.g., those who struggle with contingent reasoning [Li, 2015]. However, it…

Computer Science and Game Theory · Computer Science 2017-02-21 Diodato Ferraioli , Carmine Ventre

We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair manner. We use the stochastic dominance relation between fractional or randomized…

Computer Science and Game Theory · Computer Science 2015-06-18 Haris Aziz , Serge Gaspers , Simon Mackenzie , Toby Walsh

We consider the problem of allocating indivisible objects to agents when agents have strict preferences over objects. There are inherent trade-offs between competing notions of efficiency, fairness and incentives in assignment mechanisms.…

Theoretical Economics · Economics 2020-11-02 Priyanka Shende , Manish Purohit

Much of the theoretical work on strategic voting makes strong assumptions about what voters know about the voting situation. A strategizing voter is typically assumed to know how other voters will vote and to know the rules of the voting…

Multiagent Systems · Computer Science 2019-07-23 Wesley H. Holliday , Eric Pacuit

We consider peer review in a conference setting where there is typically an overlap between the set of reviewers and the set of authors. This overlap can incentivize strategic reviews to influence the final ranking of one's own papers. In…

Computer Science and Game Theory · Computer Science 2020-02-04 Yichong Xu , Han Zhao , Xiaofei Shi , Jeremy Zhang , Nihar B. Shah

We consider a two-sided matching problem in which the agents on one side have dichotomous preferences and the other side representing institutions has strict preferences (priorities). It captures several important applications in matching…

Computer Science and Game Theory · Computer Science 2025-02-17 Haris Aziz , Md. Shahidul Islam , Szilvia Pápai

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

In the problem of allocating a single non-disposable commodity among agents whose preferences are single-peaked, we study a weakening of strategy-proofness called not obvious manipulability (NOM). If agents are cognitively limited, then NOM…

Theoretical Economics · Economics 2024-04-25 R. Pablo Arribillaga , Agustin G. Bonifacio

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…

Computer Science and Game Theory · Computer Science 2020-07-15 Timo Mennle , Sven Seuken

We analyze the relation between strategy-proofness and preference reversal in the case that agents may declare indifference. Interestingly, Berga and Moreno (2020), have recently derived preference reversal from group strategy-proofness of…

Theoretical Economics · Economics 2021-04-23 K. P. S. Bhaskara Rao , Achille Basile , Surekha Rao

Strategic behavior is a fundamental problem in a variety of real-world applications that require some form of peer assessment, such as peer grading of homeworks, grant proposal review, conference peer review of scientific papers, and peer…

Computer Science and Game Theory · Computer Science 2022-08-30 Komal Dhull , Steven Jecmen , Pravesh Kothari , Nihar B. Shah

Multi-winner approval-based voting has received considerable attention recently. A voting rule in this setting takes as input ballots in which each agent approves a subset of the available alternatives and outputs a committee of…

Computer Science and Game Theory · Computer Science 2024-02-15 Ioannis Caragiannis , Rob LeGrand , Evangelos Markakis , Emmanouil Pountourakis

In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restricted structures?…

Theoretical Economics · Economics 2025-07-03 Pinaki Mandal

We consider the house allocation problems with strict preferences, where monetary transfers are not allowed. We propose two properties in the spirit of justified fairness. Interestingly, together with other well-studied properties…

Theoretical Economics · Economics 2024-07-22 Di Feng , Jacob Coreno

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

Obviously strategyproof (OSP) mechanisms maintain the incentive compatibility of agents that are not fully rational. They have been object of a number of studies since their recent definition. A research agenda, initiated in…

Computer Science and Game Theory · Computer Science 2018-04-30 Diodato Ferraioli , Carmine Ventre