Scientific Program Cluster Details

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only


Please login, if you want to personalize your selection of clusters.

Cluster: Game theory

Monday


10:30 - 12:00, room: MA 043

Chair: Konstantinos Bimpikis
Games in networks

Elliott A network centrality approach to coalitional stability [...]
Bimpikis Competitive marketing strategies over social networks [...]

 

13:15 - 14:45, room: MA 043

Chair: Dario Bauso
Large games and networks: Control and approachability

Como Stability analysis of transportation networks with multiscale driver decisions [...]
Bauso Time-averaged consensus and distributed approachability in large multi-agent networks [...]
Malhame Nash equilibria in radial communication networks via mean field game theory [...]

 

15:15 - 16:45, room: MA 043

Chair: Rudolf Müller
Design of optimal mechanisms

Polukarov Optimal payments in dominant-strategy mechanisms for single-parameter domains [...]
Guo Computationally feasible automated mechanism design: General approach and a case study on budget-balanced and nearly efficient randomized mechanisms [...]
Mierendorff Generalized reduced-form auctions: A network-flow approach [...]

 

 

Tuesday


10:30 - 12:00, room: MA 043

Chair: Ilan Lobel
Game-theoretic models in operations

Lobel Intertemporal price discrimination: Structure and computation of optimal policies [...]
Nazerzadeh Buy-it-now or take-a-chance: A mechanism for real-time price discrimination [...]
Perakis Markdown optimization for a fashion e-tailer: The impact of returning customers [...]

 

13:15 - 14:45, room: MA 043

Chair: Tobias Harks
Coordination mechanisms for efficient equilibria

Gourves On the price of anarchy of the set cover game [...]
Müller Mechanism design for decentralized online machine scheduling [...]
Gairing Coordination mechanisms for congestion games [...]

 

15:15 - 16:45, room: MA 043

Chair: Vijay V. Vazirani
New LCP-based market equilibrium algorithms

Ye A FPTAS for computing a symmetric Leontief competitive economy equilibrium [...]
Garg A complementary pivot algorithm for markets under separable piecewise-linear concave utilities [...]
Mehta LCP and Lemke-type algorithm for markets with production [...]

 

 

Wednesday


10:30 - 12:00, room: MA 005

Chair: Asu Ozdaglar
Games over networks

Ozdaglar Network security and contagion [...]
Parrilo Near-potential network games [...]
Jadbabaie A game-theoretic model of competitive contagion and product adoption in social networks [...]

 

10:30 - 12:00, room: MA 043

Chair: Vikas Kumar Jain
Variational inequalities in games

Golshtein Many-person games with convex structure [...]
Jain Constrained vector-valued dynamic game and symmetric duality for multiobjective variational problems [...]

 

13:15 - 14:45, room: MA 005

Chair: Berthold Vöcking
Polynomial-time algorithms for mechanism design

Krysta Combinatorial auctions with verification [...]
Csapo The private provision of a public good: Digging for gold [...]
Vidali Scheduling, auctions and truthfulness [...]

 

13:15 - 14:45, room: MA 043

Chair: Vangelis Markakis
Analysis of auction mechanisms

Paes Leme Polyhedral clinching auctions and the AdWords polytope [...]
Caragiannis Welfare and revenue guarantees in sponsored search auctions [...]
Syrgkanis Efficiency in sequential auctions [...]

 

15:15 - 16:45, room: MA 005

Chair: Laurent Gourves
Network sharing and congestion

Blogowski Access network sharing between two telecommunication operators [...]
Wan Coalitions in nonatomic network congestion games [...]
Zeitoun The complexity of approximate Nash equilibrium in congestion games with negative delays [...]

 

15:15 - 16:45, room: MA 043

Chair: Kazutoshi Ando
Solving cooperative games

Nguyen Finding solutions of large cooperative games [...]
Zhao A mixed-integer programming approach to the determination of a core element for an n-person cooperative game with nontransferable utility [...]
Ando Computation of the Shapley value of minimum cost spanning tree games: #P-hardness and polynomial cases [...]

 

 

Thursday


10:30 - 12:00, room: MA 005

Chair: Giorgos Christodoulou
Mechanisms for resource allocation problems

Ventre Using lotteries to approximate the optimal revenue [...]
Markakis On worst-case allocations in the presence of indivisible goods [...]
Kovacs Characterizing anonymous scheduling mechanisms for two tasks [...]

 

10:30 - 12:00, room: MA 043

Chair: Gabriel Weintraub and Santiago Balseiro
Mean-field approaches to large scale dynamic auctions and mechanisms

Iyer Mean field equilibria of dynamic auctions with learning [...]
Balseiro Auctions for online display advertising exchanges: Approximations and design [...]
Proutiere Optimal bidding strategies and equilibria in repeated auctions with budget constraints [...]

 

13:15 - 14:45, room: MA 005

Chair: Ioannis Caragiannis
Efficiency and optimization in games

Pasquale Logit dynamics: Expected social welfare, mixing time, and metastability [...]
Gkatzelis Truthful mechanisms for proportionally fair allocations [...]
Christodoulou Coordination mechanisms for selfish routing games [...]

 

13:15 - 14:45, room: MA 043

Chair: Tiru S. Arthanari
Game theory in supply chain management

Arthanari Game theory and supply chain management: A survey [...]
Carfì Game theoretic modeling of supply chain coopetition among growers [...]

 

15:15 - 16:45, room: MA 005

Chair: Daniel Granot
New models and solution concepts I

Wu A new solution concept for cooperative games [...]
Granot Subgame perfect consistent stability [...]

 

15:15 - 16:45, room: MA 043

Chair: Carola Winzen
Software piracy and mastermind

Perlman Software piracy prevention and price determination [...]
Winzen Playing mastermind with many colors [...]

 

 

Friday


10:30 - 12:00, room: MA 005

Chair: Yin Chen
New models and solution concepts II

Hu Existence, uniqueness, and computation of robust Nash equilibrium in a class of multi-leader-follower games [...]
Schwarze Equilibria in generalized Nash games with applications to games on polyhedra [...]
Chen Computing perfect equilibria of finite n-person games in normal form with an interior-point path-following method [...]

 

10:30 - 12:00, room: MA 043

Chair: Azarakhsh Malekian
Algorithmic game theory

Lucier Strategyproof mechanisms for competitive influence in social networks [...]
Immorlica Social networks and segregation [...]
Mobius Treasure hunt [...]

 

13:15 - 14:45, room: MA 005

Chair: Nicolas Stier-Moses and Jose Correa
Competition on networks

Nikolova A mean-risk model for the stochastic traffic assignment problem [...]
Stier-Moses The competitive facility location problem in a duopoly: Advances beyond trees [...]
Ordonez Stackelberg security games on networks [...]

 

13:15 - 14:45, room: MA 043

Chair: Max Klimm
Equilibria in congestion games

von Falkenhausen Optimal cost sharing protocols for matroid congestion games [...]
Pradeau Uniqueness of equilibrium on rings [...]
Klimm Existence and computation of equilibria in bottleneck congestion games [...]

 

15:15 - 16:45, room: MA 005

Chair: Vinayak Shanbhag
Learning and computation for game-theoretic problems

Morrow Computing equilibria in regulated differentiated product market models [...]
Nedich A gossip algorithm for aggregative games on graphs [...]

 

15:15 - 16:45, room: MA 043

Chair: Marc Uetz
Analysis of equilibria in noncooperative games

Hoefer Contribution games in networks [...]
Harks Congestion games with variable demands [...]
de Jong Decentralized mechanisms for throughput scheduling [...]

 

 

Program -> Parallel Sessions -> Cluster List -> Details all clusters
Search talks included | sessions only
  There are three major facts that should be watched out for in all payday loans in the United States. Since its introduction in the market buying Order Cialis can be exclusively in pharmacy chains with a prescription from a doctor. I agree that this is very inconvenient and takes a lot of time and effort.