English
Related papers

Related papers: Pareto Efficient Nash Implementation Via Approval …

200 papers

In Feinstein and Rudloff (2023), it was shown that the set of Nash equilibria for any non-cooperative $N$ player game coincides with the set of Pareto optimal points of a certain vector optimization problem with non-convex ordering cone. To…

Optimization and Control · Mathematics 2024-04-24 Zachary Feinstein , Niklas Hey , Birgit Rudloff

This paper proposes a novel energy sharing mechanism for prosumers who can produce and consume. Different from most existing works, the role of individual prosumer as a seller or buyer in our model is endogenously determined. Several…

Optimization and Control · Mathematics 2019-10-08 Yue Chen , Shengwei Mei , Fengyu Zhou , Steven H. Low , Wei Wei , Feng Liu

We study the voting problem with two alternatives where voters' preferences depend on a not-directly-observable state variable. While equilibria in the one-round voting mechanisms lead to a good decision, they are usually hard to compute…

Computer Science and Game Theory · Computer Science 2025-05-16 Qishen Han , Grant Schoenebeck , Biaoshuai Tao , Lirong Xia

An important aspect of AI design and ethics is to create systems that reflect aggregate preferences of the society. To this end, the techniques of social choice theory are often utilized. We propose a new social choice function motivated by…

Multiagent Systems · Computer Science 2021-03-02 Gergei Bana , Wojciech Jamroga , David Naccache , Peter Y. A. Ryan

We study a sequence of independent one-shot non-cooperative games where agents play equilibria determined by a tunable mechanism. Observing only equilibrium decisions, without parametric or distributional knowledge of utilities, we aim to…

Computer Science and Game Theory · Computer Science 2025-11-10 Luke Snow , Vikram Krishnamurthy

A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…

Optimization and Control · Mathematics 2012-03-09 Rosa Camps , Xavier Mora , Laia Saumell

With the advent of prosumers, the traditional centralized operation may become impracticable due to computational burden, privacy concerns, and conflicting interests. In this paper, an energy sharing mechanism is proposed to accommodate…

Optimization and Control · Mathematics 2020-12-29 Yue Chen , Changhong Zhao , Steven H. Low , Shengwei Mei

In a 2017 paper, later presented at the Web and Internet Economics conference, titled ``Sequential Deliberation for Social Choice", the authors propose a mechanism in which a series of agents, are tasked to negotiate over a set of decisions…

Computer Science and Game Theory · Computer Science 2023-02-13 Gokul Dharan , Hunter Guru , Michael Sun

We generalize the classic problem of fairly allocating indivisible goods to the problem of \emph{fair public decision making}, in which a decision must be made on several social issues simultaneously, and, unlike the classic setting, a…

Computer Science and Game Theory · Computer Science 2017-06-01 Vincent Conitzer , Rupert Freeman , Nisarg Shah

Typical voting rules do not work well in settings with many candidates. If there are just several hundred candidates, then even a simple task such as choosing a top candidate becomes impractical. Motivated by the hope of developing group…

Computer Science and Game Theory · Computer Science 2012-10-03 Ashish Goel , David Lee

We consider normal-form games with $n$ players and two strategies for each player, where the payoffs are i.i.d. random variables with some distribution $F$ and we consider issues related to the pure equilibria in the game as the number of…

Probability · Mathematics 2021-02-24 Matteo Quattropani , Marco Scarsini

We design two mechanisms that ensure that the majority preferred option wins in all equilibria. The first one is a simultaneous game where agents choose other agents to cooperate with on top of the vote for an alternative, thus overcoming…

Theoretical Economics · Economics 2023-10-12 Kirneva Margarita , Núñez Matías

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users…

Information Theory · Computer Science 2010-10-05 Xi Liu , Elza Erkip

An inconsistent knowledge base can be abstracted as a set of arguments and a defeat relation among them. There can be more than one consistent way to evaluate such an argumentation graph. Collective argument evaluation is the problem of…

Artificial Intelligence · Computer Science 2017-06-20 Edmond Awad , Martin Caminada , Gabriella Pigozzi , Mikołaj Podlaszewski , Iyad Rahwan

To guarantee all agents are matched in general, the classic Deferred Acceptance algorithm needs complete preference lists. In practice, preference lists are short, yet stable matching still works well. This raises two questions: $\bullet$…

Computer Science and Game Theory · Computer Science 2023-05-02 Ishan Agarwal , Richard Cole

We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…

Mathematical Finance · Quantitative Finance 2023-03-15 Anastasiya Tanana

An equilibrium is communication-proof if it is unaffected by new opportunities to communicate and renegotiate. We characterize the set of equilibria of coordination games with pre-play communication in which players have private preferences…

Theoretical Economics · Economics 2023-11-14 Yuval Heller , Christoph Kuzmics

In this work we introduce a new model of decision-making by agents in a social network. Agents have innate preferences over the strategies but, because of the social interactions, the decision of the agents are not only affected by their…

Computer Science and Game Theory · Computer Science 2020-02-05 Angelo Fanelli , Dimitris Fotakis

In the house allocation problem with lower and upper quotas, we are given a set of applicants and a set of projects. Each applicant has a strictly ordered preference list over the projects, while the projects are equipped with a lower and…

Computer Science and Game Theory · Computer Science 2021-07-09 Ágnes Cseh , Tobias Friedrich , Jannik Peters

Purely affective interaction allows the welfare of an individual to depend on her own actions and on the profile of welfare levels of others. Under an assumption on the structure of mutual affection that we interpret as "non-explosive…

General Economics · Economics 2023-05-18 Aviad Heifetz , Enrico Minelli , Herakles Polemarchakis