paper-with-me

홈 › Papers

An Experimental Study on Learning Correlated Equilibrium in Routing Games

2022-07-31 · Yixian Zhu, Ketan Savla

We study route choice in a repeated routing game where an uncertain state of nature determines link latency functions, and agents receive private route recommendation. The state is sampled in an i.i.d. manner in every round from a publicly known distribution, and the recommendations are generated by a randomization policy whose mapping from the state is known publicly. In a one-shot setting, the agents are said to obey recommendation if it gives the smallest travel time in a posteriori expectation. A plausible extension to repeated setting is that the likelihood of following recommendation in a round is related to regret from previous rounds. If the regret is of satisficing type with respect to a default choice and is averaged over past rounds and over all agents, then the asymptotic outcome under an obedient recommendation policy coincides with the one-shot outcome. We report findings from an experiment with one participant at a time engaged in repeated route choice decision on computer. In every round, the participant is shown travel time distribution for each route, a route recommendation generated by an obedient policy, and a rating suggestive of average experience of previous participants with the quality of recommendation. Upon entering route choice, the actual travel times are revealed. The participant evaluates the quality of recommendation by submitting a review. This is combined with historical reviews to update rating for the next round. Data analysis from 33 participants each with 100 rounds suggests moderate negative correlation between the display rating and the average regret, and a strong positive correlation between the rating and the likelihood of following recommendation. Overall, under obedient recommendation policy, the rating converges close to its maximum value by the end of the experiments in conjunction with very high frequency of following recommendations.

📄 PDF Abstract BibTeX arXiv:2208.00391

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Travel 설명 없음

Similar Papers 제목 키워드 기반

Learning Correlated Equilibria in Mean-Field Games

2022-08-22 · Paul Muller, Romuald Elie, Mark Rowland, Mathieu Lauriere 외

The designs of many large-scale systems today, from traffic routing environments to smart grids, rely on game-theoretic equilibrium concepts. However, as the size of an $N$-player game typically grows exponentially with …

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games

2024-01-26 · Yang Cai, Haipeng Luo, Chen-Yu Wei, Weiqiang Zheng

We study policy optimization algorithms for computing correlated equilibria in multi-player general-sum Markov Games. Previous results achieve $O(T^{-1/2})$ convergence rate to a correlated equilibrium and an accelerated…

The complexity of approximate (coarse) correlated equilibrium for incomplete information games

2024-06-04 · Binghui Peng, Aviad Rubinstein

We study the iteration complexity of decentralized learning of approximate correlated equilibria in incomplete information games. On the negative side, we prove that in $\mathit{extensive}$-$\mathit{form}$ $\mathit{games…

Robust Correlated Equilibrium: Definition and Computation

2023-11-29 · Rahul Misra, Rafał Wisniewski, Carsten Skovmose Kallesøe, Manuela L. Bujorianu

We study N-player finite games with costs perturbed due to time-varying disturbances in the underlying system and to that end we propose the concept of Robust Correlated Equilibrium that generalizes the definition of Cor…

Computing Optimal Coarse Correlated Equilibria in Sequential Games

2019-01-18 · Andrea Celli, Stefano Coniglio, Nicola Gatti

We investigate the computation of equilibria in extensive-form games where ex ante correlation is possible, focusing on correlated equilibria requiring the least amount of communication between the players and the mediat…

Form